The Chinese Remainder Theorem · Medium problem

$x \equiv 1 \pmod 4,\ x \equiv 3 \pmod 6$

$x \equiv 1 \pmod 4,\ x \equiv 2 \pmod 6$

$x \equiv 2 \pmod 9,\ x \equiv 5 \pmod{12}$

$x \equiv 0 \pmod 8,\ x \equiv 4 \pmod{12}$