CLSLDR  Class Leader
This is new year in Planet X and there is something special! A classroom in this planet is looking for a new class leader using an unique game!
These are the ways how the game is played.
1. There are n students in the class. Each student is labeled from 1 (first student) to n (last student).
2. A paper is given to mth student.
3. The next oth student who gets the paper quits the game.
4. The paper is passed until there is one last student who hasn't quitted the game.
5. The student becomes the class leader.
Now, your task is to find the number of such student.
Input
The first line contains a number T (0 <= T <= 10^{6}).
Each of the next T lines contains 3 integers which are n (0 < n <= 10^{3}), m, o (0 < m, o <= n) and are separated by a single space.
Output
For each test cases, print the required answer.
Example
Input: 2
4 1 2
5 2 3 Output: 2
1
Explanation for test case 1
1 2 3 4 > The paper is being held by student 1. Pass the paper by 2 students. Now, the paper is being held by student 3.
1 2 4 > Student 3 quits. Pass the paper by 2 students. Now, the paper is being held by student 1.
2 4 > Student 1 quits. Pass the paper by 2 students. Now, the paper is being held by student 4.
2 > Student 4 quits. Student 2 becomes the class leader.
hide comments
delta01:
20191006 16:09:01
time limit exceeded problem .. dont know where to reduce complexity Last edit: 20191006 18:25:02 

kumar0916:
20190924 23:10:57


amit013:
20190226 23:09:38
Please remove this problem if you don't want us to be able to solve it. I have never seen so stupid time limit.


anonymous:
20170222 09:45:36
It looks like the input test cases do not satisfy given constraints (probably last one):


vivek_singhvi:
20170221 08:55:57
TLE with O(n) approach any suggestion


marcelljason06:
20170216 15:11:54
are you sure with all of your testcases? please check again.

Added by:  Lucas 
Date:  20170214 
Time limit:  0.699s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All 