Description

Libra and Rahn are playing a game.

Libra has a non-negative integer $A$ and Rahn has a non-negative integer $B$. Libra wants to take several steps to change $A$ to $B$. Each step Libra can take one of the following operations:

• Add $1$ to $A$ ($A\to A+1$).
• Multiply $A$ by $2$ ($A \to 2A$).
• Divide $A$ by $2$ ($A \to \frac{A}{2}$). Note that Libra can take this operation only if $A$ is even.

Libra wants to know the minimum steps to change $A$ to $B$ using the operations above.

Format

Input

The first line contains one integer $T(1\le T\le 10000)$ -- the number of test cases.

For each test case there is a single line contains two integers $A,B(1\le A,B\le 10^{18})$.

Output

For each test case, output a line with an integer representing the minimum steps Libra needs to take.

Samples

6
31 13
12 8
25 6
10 24
1 1
997 120

8
3
8
3
0
20