Orders and Primitive Roots · Superchallenge problem

How many ordered pairs $(a, b)$ with $1 \le a \le 18$ and $1 \le b \le 18$ are such that $a \equiv b^k \pmod{19}$ for some positive integer $k$?