description: Berland State University has received a new update for the operating system. Initially it is installed only on the 1-st computer.
  
  Update files should be copied to all n 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 n computers if there are only k patch cables in Berland State University.
  
  Input
  
  The first line contains a single integer t (1 ≤ t ≤ 10^5) — the number of test cases.
  
  Each test case consists of a single line that contains two integers n and k (1 ≤ k ≤ n ≤ 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.
  
  Example
  
  Input
  
  
  4
  8 3
  6 6
  7 1
  1 1
  
  
  Output
  
  
  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. 
solution: import java.util.*;
  import java.io.*;
  import java.lang.*;
  
  public class Problem {
      static int Mod = 1000000007;
  
      public static void main(String[] args) {
          MyScanner scan = new MyScanner();
          PrintWriter out = new PrintWriter(new BufferedOutputStream(System.out));
          int t = scan.nextInt();
          // int t=1;
          while (t-- > 0) {
              long n = scan.nextLong();
              long k = scan.nextLong();
  
              long computers = 1l;
              long ans = 0;
  
              while (computers < k) {
                  computers += computers;
                  ans++;
              }
              long rem = n - computers;
              if (rem <= 0) {
              } else {
                  ans += (rem >= 0 && rem % k == 0) ? rem / k : (rem / k) + 1l;
              }
  
              out.println(ans);
  
          }
          out.close();
      }
  
      static class Pair {
          int l;
          int r;
  
          Pair(int l, int r) {
              this.l = l;
              this.r = r;
          }
  
          @Override
          public int hashCode() {
              final int prime = 31;
              int result = 1;
              result = prime * result + l;
              result = prime * result + r;
              return result;
          }
  
          @Override
          public boolean equals(Object obj) {
              if (this == obj)
                  return true;
              if (obj == null)
                  return false;
              if (getClass() != obj.getClass())
                  return false;
              Pair other = (Pair) obj;
              if (l != other.l)
                  return false;
              if (r != other.r)
                  return false;
              return true;
          }
  
          @Override
          public String toString() {
              return "Pair [l=" + l + ", r=" + r + "]";
          }
      }
  
      public static void sort(int[] array) {
          ArrayList<Integer> copy = new ArrayList<>();
          for (Integer i : array)
              copy.add(i);
          Collections.sort(copy);
          for (int i = 0; i < array.length; i++)
              array[i] = copy.get(i);
      }
  
      public static void sort(long[] array) {
          ArrayList<Long> copy = new ArrayList<>();
          for (Long i : array)
              copy.add(i);
          Collections.sort(copy);
          for (int i = 0; i < array.length; i++)
              array[i] = copy.get(i);
      }
  
      public static long gcd(long a, long b) {
          if (b == 0)
              return a;
          return gcd(b, a % b); // gcd(a,b) = gcd(a-b,b) or gcd(a,b) = gcd(b,a%b) where a>b
      }
  
      public static int gcd(int a, int b) {
          if (b == 0)
              return a;
          return gcd(b, a % b); // gcd(a,b) = gcd(a-b,b) or gcd(a,b) = gcd(b,a%b) where a>b
      }
  
      public static long lcm(long a, long b) {
          return (a / gcd(a, b)) * b;
      }
  
      static long power(long x, long y) {
          long temp;
          if (y == 0) // a^b= (a^b/2)^2 if b is even
              return 1; // = (a*a^(b-1)) if b is odd
          temp = power(x, y / 2);
          if (y % 2 == 0)
              return temp * temp;
          else
              return x * temp * temp;
      }
  
      static long mod(long x) {
          return ((x % Mod + Mod) % Mod);
      }
  
      static long add(long a, long b) {
          return mod(mod(a) + mod(b));
      }
  
      static long mul(long a, long b) {
          return mod(mod(a) * mod(b));
      }
  
      static long pow(long x, long y, long p) {
          long res = 1; // Initialize result
          x = x % p; // Update x if it is more than or equal to p
  
          if (x == 0)
              return 0; // In case x is divisible by p;
  
          while (y > 0) {
              // If y is odd, multiply x with result
              if ((y & 1) != 0)
                  res = (res * x) % p;
  
              // y must be even now
              y = y >> 1; // y = y/2
              x = (x * x) % p;
          }
          return res;
      }
  
      static long modInverse(long a, long m) {
          // int g = gcd(a, m);
          // if (g != 1)
          // System.out.println("Inverse doesn't exist");
          // else {
          // // If a and m are relatively prime, then modulo
          // // inverse is a^(m-2) mode m
          // return power(a, m - 2, m);
          // }
          return pow(a, m - 2, m);
      }
  
  }
  
  class MyScanner {
      BufferedReader br;
      StringTokenizer st;
  
      public MyScanner() {
          br = new BufferedReader(new InputStreamReader(System.in));
      }
  
      String next() {
          while (st == null || !st.hasMoreElements()) {
              try {
                  st = new StringTokenizer(br.readLine());
              } catch (IOException e) {
                  e.printStackTrace();
              }
          }
          return st.nextToken();
      }
  
      int nextInt() {
          return Integer.parseInt(next());
      }
  
      long nextLong() {
          return Long.parseLong(next());
      }
  
      double nextDouble() {
          return Double.parseDouble(next());
      }
  
      String nextLine() {
          String str = "";
          try {
              str = br.readLine();
          } catch (IOException e) {
              e.printStackTrace();
          }
          return str;
      }
  
  }
  