Find the smallest positive integer \( x \) such that the following system of congruences is satisfied:
\[
\begin{align*}
3x &\equiv 7 \pmod{11} \\
5x &\equiv 2 \pmod{13}
\end{align*}
\] Let's think step by step and output the final answer within \boxed{}.
user