Problem Description

Farmer John is playing math game with cows. To help his cows learning addition and multiplication, he invented a new game. In the beginning, he would provide two number $a$ and $b$. After that, cows would report two number each turn. At the turn $i$, $i\times a$ and $i \times b$ should be reported. Once there exists an integer in the segment $[i \times a, i \times b]$, the game ends. Now, John wants to know after how many turns the game would end. So, he ask for your help.

Input

The first line is the number of test cases. For each test case, there are two non-negative float-point numbers $a$ and $b$. The precision of these numbers are less than $300$ decimal places. It is guaranteed that $a < b$.

Output

For each test case, output an integer $n$ donating that the game will end in $n$ turns.

1
1.2 1.3

4