It is well known that a^x ≡ b (mod q) can be solved for x in applying meet-in-the-middle optimization after rewriting an equation like that a^gk ≡ ba^h (mod q), where gk - h = x.

How can one solve (a^x mod p) ≡ b (mod q), where p, q are prime numbers and p > q?