you need to find a generator $\bmod 2$ and $\bmod 11$.
The generator $\bmod 2$ is cleary $1$.
To find a generator $\bmod 121$ we find one $\bmod 11$ first by trial and error.
$2,4,8,5,-1,-2,-4-8,-5,1$. Bingo! $2$ is a generator.
we now use this lemma to make it easier:
if $a$ is a generator $\bmod p$ then one of $a$ and $a+p$ has order $p-1$ and the other is a generator.
since $2^{10}-1=1027$ is not a multiple of $11$ we are done. $2$ is a generator $\bmod 11^2$.
So now we just need to solve the congruence equation $x\equiv 1 \bmod 2,x\equiv 2 \bmod 121$ which is clearly solved by $123\bmod 242$. We are done.
Most cases are not as easy as this one, but the ideas in the solution are useful most of the times.(something that we didn't need but always helps is that if $x$ is a generator $\bmod p^2$ then $x$ is a generator $\bmod p^k$ for all $k$, (when $p$ is an odd prime))