The Chinese Remainder Theorem · Challenge problem

Find the smallest positive integer $n$ with $n \equiv 3 \pmod{10}$, $n \equiv 13 \pmod{14}$ and $n \equiv 3 \pmod{15}$.