Description

Input

Each test contains multiple test cases. The first line contains the number of test cases $t$ ($1 \le t \le 100$). The description of the test cases follows.

The only line of each test case contains two integers, $a$ and $b$ ($1 \le a < b \le 100$).

Output

For each test case, output any positive integer $n$ ($1 \le n \le 10^6$) such that the second player to move wins.

It can be proven that such an $n$ always exists under the constraints of the problem.

3
1 4
1 5
9 26

2
6
3

Note

In the first test case, when $n = 2$, the first player must remove $a = 1$ stone. Then, the second player can respond by removing $a = 1$ stone. The first player can no longer make a move, so the second player wins.

In the second test case, when $n = 6$, the first player has two options:

• If they remove $b = 5$ stones, then the second player can respond by removing $a = 1$ stone. The first player can no longer make a move, so the second player wins.
• If they remove $a = 1$ stone, then the second player can respond by removing $a = 1$ stone. Afterwards, the players can only alternate removing exactly $a = 1$ stone. The second player will take the last stone and win.

Since the second player has a winning strategy no matter what the first player does, this is an acceptable output.

In the third test case, the first player cannot make any moves when $n = 3$, so the second player immediately wins.