elementary number theory - Finding values for Chinese Remainder Theorem

So I have looked over a lot of the other Chinese Remainder Theorems on here and I still can not completely understand how to answer my question. The question is "Use the construction in the proof of Chinese remainder theorem to find all solutions to the system of congruences."
\begin{align}
x &\equiv 1 \pmod{3} \\
x &\equiv 0 \pmod{4} \\
x &\equiv 1 \pmod{5}
\end{align}

I found my $M=60$, $M_1= 20$, $M_2=15$, $M_3=12$, $a_1=1$, $a_2=0$, $a_3=1$, but I do not understand how to calculate $y_1$, $y_2$, and $y_3$. I think I am supposed to do something with the Euclidian algorithm but I am not sure.