Find an integer which is congruent to 27 mod 53, 67 mod 115 and 109 mod 129.

Hint: First find an integer which is congruent to 27 mod 53, 67 mod 115.

Not sure how to go about solving this question. I'm assuming Euclids algorithm is involved to find the gcd but then I don't know what to do