Write a python program which inputs a,b,m,n (all are integers) m and n being greater than or equal to 1. The gcd(m,n) = 1. Implement chinese remainder theorem to output the smallest nonnegative integer x which solves the system of congruences:

x congruent to a (modulo m)

and x congruent to b (modulo n).

I was told this shouldn't be hard but I'm personally struggling!