The Chinese Remainder Theorem · Medium problem

Find the smallest positive integer $x$ satisfying both $3x \equiv 2 \pmod 5$ and $2x \equiv 1 \pmod 7$.