State the Chinese Remainder Theorem.

Determine all integers $x$ satisfying the congruences $x \equiv 2 \bmod 3, x \equiv 2 \bmod 5$, $x \equiv 6 \bmod 7 .$