No submission language available for this problem.

Description

Input

The first line contains a single integer $t$ ($1 \le t \le 10^5$) — the number of test cases.

Each test case consists of a single line that contains two integers $n$ and $k$ ($1 \le k \le n \le 10^{18}$) — the number of computers and the number of patch cables.

Output

For each test case print one integer — the minimum number of hours required to copy the update files to all $n$ computers.

Samples

4
8 3
6 6
7 1
1 1

4
3
6
0

Note

Let's consider the test cases of the example:

• $n=8$, $k=3$:
  1. during the first hour, we copy the update files from the computer $1$ to the computer $2$;
  2. during the second hour, we copy the update files from the computer $1$ to the computer $3$, and from the computer $2$ to the computer $4$;
  3. during the third hour, we copy the update files from the computer $1$ to the computer $5$, from the computer $2$ to the computer $6$, and from the computer $3$ to the computer $7$;
  4. during the fourth hour, we copy the update files from the computer $2$ to the computer $8$.
• $n=6$, $k=6$:
  1. during the first hour, we copy the update files from the computer $1$ to the computer $2$;
  2. during the second hour, we copy the update files from the computer $1$ to the computer $3$, and from the computer $2$ to the computer $4$;
  3. during the third hour, we copy the update files from the computer $1$ to the computer $5$, and from the computer $2$ to the computer $6$.
• $n=7$, $k=1$:
  1. during the first hour, we copy the update files from the computer $1$ to the computer $2$;
  2. during the second hour, we copy the update files from the computer $1$ to the computer $3$;
  3. during the third hour, we copy the update files from the computer $1$ to the computer $4$;
  4. during the fourth hour, we copy the update files from the computer $4$ to the computer $5$;
  5. during the fifth hour, we copy the update files from the computer $4$ to the computer $6$;
  6. during the sixth hour, we copy the update files from the computer $3$ to the computer $7$.