Got an AC!!:)

what happened to "please don't make problems with time limits of less than 0.5s" ? -.-

I use an algorithm with time complexity O(logm+logn*(7^3)+k) got TLE.
Have somebody used it AC?

I have an O( k + log M ) algorithm, but I think the mod operations are quite expensive, I think if the complexity isnt any better, there is no point of optimising it to the brink, not all of us are qualified to do that :P
I have improved my I/O too, besides this is too much biased for C++ people, what if somebody decides to write in Java.

Just a question, is k <= 7 ,
if not so my solution is super-slow :)

Re: "quite expensive", but not very ;) so try to find a way to improve your execution time, several ones got AC with SUPER time :)

Or your code is super-slow :)
I've checked on Vietnamese site the same problem has already solved by 5 peoples (including me), the fastest is my: 0.16 sec. The slowest is 1.15 sec.