Chef has two integers X and Y. Chef wants to perform some operations to make X and Y equal. In one operation, Chef can either:
set X := X + 1
or set Y := Y + 2

Find the minimum number of operations required to make X and Y equal.

------ Input Format ------

• The first line contains a single integer T — the number of test cases. Then the test cases follow.
• The first and only line of each test case contains two space separated integers X and Y.

------ Output Format ------

For each test case, print the minimum number of operations required to make X and Y equal.

------ Constraints ------

$1 ≤ T ≤ 10^{4}$
$1 ≤ X, Y ≤ 10^{9}$

----- Sample Input 1 ------
5
3 4
5 5
7 3
5 2
7 12

----- Sample Output 1 ------
1
0
2
3
5

----- explanation 1 ------
Let $(x, y)$ denote the values of $X$ and $Y$ respectively.

Test case $1$: Only one operation is required: $(3, 4) \xrightarrow{X := X + 1}{} (4, 4)$

Test case $2$: No operations are required since $X$ and $Y$ are already equal.

Test case $3$: Two operations are required: $(7, 3) \xrightarrow{Y := Y + 2}{} (7, 5) \xrightarrow{Y := Y + 2}{} (7, 7)$

Test case $4$: Three operations are required. One such sequence of operations is: $(5, 2) \xrightarrow{Y := Y + 2}{} (5, 4) \xrightarrow{X := X + 1}{} (6, 4) \xrightarrow{Y := Y + 2}{} (6, 6)$

见题面

见题面