This is an interactive problem. The editorial said that the first pair $$$(l0, r0)$$$ that satisfied $$$l0 \bmod a > r0 \bmod a$$$ is also statisfied the inequality $$$l0 \le a \le r0$$$. How to proof it? It is obviously some example like $$$l0 = 16, r0 = 32, a = 6$$$, it is also statisfied the conditions but I don't know if the pair is the first.

Problem

152279908

I passed both two examples.But when I submit the code,I get a Wrong answer on test 1.

I'm so confused that I want to know how to solve it.

Who can help me,please.

Thank you very much!

My English is very bad,please don't laugh at me.