From Zero To Y

Description:

Input:

The first line contains one integer $$$t$$$ ($$$1 \le t \le 2 \cdot 10^4$$$) — the number of test cases.

Each test case consists of one line containing two integer $$$x$$$ and $$$y$$$ ($$$1 \le x, y \le 10^9$$$).

Output:

For each test case, print one integer — the minimum number of operations to set the value of $$$k$$$ to $$$y$$$.

Sample Input:

3
2 7
3 42
25 1337

Sample Output:

4
5
20

Note:

In the first test case you can use the following sequence of operations:

1. add $$$1$$$;
2. add $$$2 \cdot 10^0 = 2$$$;
3. add $$$2 \cdot 10^0 = 2$$$;
4. add $$$2 \cdot 10^0 = 2$$$.

$$$1 + 2 + 2 + 2 = 7$$$.

In the second test case you can use the following sequence of operations:

1. add $$$3 \cdot 10^1 = 30$$$;
2. add $$$3 \cdot 10^0 = 3$$$;
3. add $$$3 \cdot 10^0 = 3$$$;
4. add $$$3 \cdot 10^0 = 3$$$;
5. add $$$3 \cdot 10^0 = 3$$$.

$$$30 + 3 + 3 + 3 + 3 = 42$$$.