Hello codeforces!

I need help in this problem UVa_11754

If all Ki = 1, we can use Chinese Remainder Theorem directly, But the number of possible states is (Π Ki = 100^9)

So can you help me in this problem?

I believe that there is brute_force in it but i couldn't find it ):