The Chinese Remainder Theorem · Hard problem

Find the smallest positive integer $x$ such that $x \equiv 2 \pmod 3$, $2x \equiv 3 \pmod 5$ and $3x \equiv 4 \pmod 7$.