Minimize Bits

You are given a number $N$. You have to find the $k-th$ bit from left whether it is set or not, now considering that bit as the leftmost bit of number $Z$. Find the minimum number of bits which is required such that $Z$ is divisible by $N$ ###Input: - First line will contain $T$, number of testcases. - Each line of testcase contains two space separated numbers $N$ and $k$. ###Output: P