Hello codeforces!

I need help with 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)

I believe there is a brute_force solution but i couldn't find it ):