Chinese Remainder Theorem

I'm trying to find all solutions to this system of congruences:

x = 1(mod 2) (sorry, I'm using = instead of the logical equivalence)
x = 2(mod 3)
x = 3(mod 5)
x = 4(mod 11)

2 * 3 * 5 * 11 = 330

M1 = m / 2 = 165 (3 * 5 * 11)
M2 = m / 3 = 110 (2 * 5 * 11)
M3 = m / 5 = 66 (2 * 3 * 11)
M4 = m /11 = 30 (2 * 3 * 5) (I think this is where my problem is)

165 = 1(mod 2)
110 = 1(mod 3)
66 = 1(mod 5)
30 = 8(mod 11)

x = 1 * 165 * 1 + 2 * 110 * 2 + 3 * 66 * 1 + 4 * 30 * 8 = 1763

1763 = 113(mod 330)

x = 113 holds up for the first three congruences, but fails on the 4th.

Could someone please point out where I'm going wrong? I have no problem solving the system with the first three congruences, but every time I add the fourth and try to solve it, I run into problems.

I have noticed that people who use these mechanical algorithms for problems of this sort often end up with the wrong answer. I'm sure that the formulas work if they are used correctly, but in practice they seem to invite arithmetic mistakes. So I prefer to avoid the formulas and use more common-sense methods.

In this case, if you can deal with the first three congruences then you know that , and you want to combine this with . The first of those congruences looks simpler if you add 7 to both sides, to get . By good fortune, the second congruence also looks simpler if you add 7 to both sides, to get . So x+7 is a multiple of both 11 and 30, and therefore it is a multiple of 330. Therefore .