Fermat, Euler and Wilson · Superchallenge problem

The number $101$ is prime. Find the integer $x$ with $0 \le x < 101$ such that $x^7 \equiv 3 \pmod{101}$.