I am given the system of linear congruences:
$x\equiv 2$ mod $7$, $x\equiv 3$ mod $11$, and $x\equiv 4$ mod $13$.
I start to solve by substituting the first equation into the second, yielding: $x=2+7(-3+11m)$ for some $m\in\mathbb{Z}$. With some algebra, we find $x=-19+77m$.
I then plug that result for $x$ into the 3rd equation to find: $77m-13n=23$ for some $m,n\in\mathbb{Z}$. Then, I use Euclid's Algorithm to solve that equation, where I find $m=-23$ and $n=-138$.
What do I do with these solutions? How can I continue with the original problem? Edit: Please keep answers within the realms of this method.