Contents

# Click Here!

Berland State University has received a new update for the operating system. Initially it is installed only on the 11-st computer.

Update files should be copied to all nn computers. The computers are not connected to the internet, so the only way to transfer update files from one computer to another is to copy them using a patch cable (a cable connecting two computers directly). Only one patch cable can be connected to a computer at a time. Thus, from any computer where the update files are installed, they can be copied to some other computer in exactly one hour.

Your task is to find the minimum number of hours required to copy the update files to all nn computers if there are only kk patch cables in Berland State University.

Input

## Update Files solution codeforces

The first line contains a single integer tt (1t1051≤t≤105) — the number of test cases.

Each test case consists of a single line that contains two integers nn and kk (1kn10181≤k≤n≤1018) — the number of computers and the number of patch cables.

Output

## Update Files solution codeforces

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

Example
input

Copy
4
8 3
6 6
7 1
1 1

output

## Update Files solution codeforces

Copy
4
3
6
0

Note

## Update Files solution codeforces

Let’s consider the test cases of the example:

• n=8n=8k=3k=3:
1. during the first hour, we copy the update files from the computer 11 to the computer 22;
2. during the second hour, we copy the update files from the computer 11 to the computer 33, and from the computer 22 to the computer 44;
3. during the third hour, we copy the update files from the computer 11 to the computer 55, from the computer 22 to the computer 66, and from the computer 33 to the computer 77;
4. during the fourth hour, we copy the update files from the computer 22 to the computer 88.
• n=6n=6k=6k=6:
1. during the first hour, we copy the update files from the computer 11 to the computer 22;
2. during the second hour, we copy the update files from the computer 11 to the computer 33, and from the computer 22 to the computer 44;
3. during the third hour, we copy the update files from the computer 11 to the computer 55, and from the computer 22 to the computer 66.
• ## Update Files solution codeforces

n=7n=7k=1k=1:

1. during the first hour, we copy the update files from the computer 11 to the computer 22;
2. during the second hour, we copy the update files from the computer 11 to the computer 33;
3. during the third hour, we copy the update files from the computer 11 to the computer 44;
4. during the fourth hour, we copy the update files from the computer 44 to the computer 55;
5. during the fifth hour, we copy the update files from the computer 44 to the computer 66;
6. during the sixth hour, we copy the update files from the computer 33 to the computer 77.