Problem C - Steps 
-----------------

One steps through integer points of the straight line following these
rules:

1. The length of a step must be nonnegative and can be by one bigger
than, equal to, or by one smaller than the length of the previous step.

2. The length of the first and the last step must be 1.

What is the minimum number of steps in order to get from x to y?

Input
-----

Input consists of a line containing n, the number of test cases. For
each test case, a line follows with two integers: 0 <= x <= y <= 2^31.

Output
------

For each test case, print a line giving the minimum number of steps to
get from x to y.

Sample Input 
------------

3
45 48
45 49
45 50

Output for Sample Input
-----------------------

3
3
4