Taekwondo King

Taegyun is in the middle of a taekwondo bout. He is behind on points, so from now on he fights seriously and tries to catch up fast.

Taegyun has two combo kicks.

1. Combo A is a huge combo that gains as many points as his current score. One use turns Taegyun's score $S$ into $2S$. The risk is that the opponent also scores 3 points, so $T$ becomes $T + 3$.
2. Combo B gains 1 point. One use turns $S$ into $S + 1$.

He may use the two combos any number of times in any order, and the scores are compared after each single kick. Given Taegyun's current score $S$ and the opponent's current score $T$, write a program that finds the minimum number of combo kicks that makes $S$ and $T$ equal.

The first line contains the number of test cases $C$ ($1 \le C \le 100$). Each of the next $C$ lines contains the current scores $S$ and $T$ for one test case, separated by a space. ($1 \le S < T \le 100$)

For each test case, print the minimum number of combo kicks that makes $S$ and $T$ equal, one per line.