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: #include <bits/stdc++.h>
  using namespace std;
  const string yo = "YES";
  const string no = "NO";
  const int inf = 2000000000;
  const long long infll = 9000000000000000000;
  template <class T>
  bool umin(T& a, const T& b) {
    return b < a ? a = b, 1 : 0;
  }
  template <class T>
  bool umax(T& a, const T& b) {
    return a < b ? a = b, 1 : 0;
  }
  long long FIRSTTRUE(function<bool(long long)> f, long long lb, long long rb) {
    while (lb < rb) {
      long long mb = (lb + rb) / 2;
      f(mb) ? rb = mb : lb = mb + 1;
    }
    return lb;
  }
  long long LASTTRUE(function<bool(long long)> f, long long lb, long long rb) {
    while (lb < rb) {
      long long mb = (lb + rb + 1) / 2;
      f(mb) ? lb = mb : rb = mb - 1;
    }
    return lb;
  }
  template <class A>
  void read(vector<A>& v);
  template <class A, size_t second>
  void read(array<A, second>& a);
  template <class T>
  void read(T& x) {
    cin >> x;
  }
  void read(double& d) {
    string t;
    read(t);
    d = stod(t);
  }
  void read(long double& d) {
    string t;
    read(t);
    d = stold(t);
  }
  template <class H, class... T>
  void read(H& h, T&... t) {
    read(h);
    read(t...);
  }
  template <class A>
  void read(vector<A>& x) {
    for (auto& a : x) read(a);
  }
  template <class A, size_t second>
  void read(array<A, second>& x) {
    for (auto& a : x) read(a);
  }
  string to_string(char c) { return string(1, c); }
  string to_string(bool b) { return b ? "true" : "false"; }
  string to_string(const char* s) { return string(s); }
  string to_string(string s) { return s; }
  string to_string(vector<bool> v) {
    string res;
    for (int i = (0); (1) > 0 ? i < ((int)(v).size()) : i > ((int)(v).size());
         i += (1))
      res += char('0' + v[i]);
    return res;
  }
  template <size_t second>
  string to_string(bitset<second> b) {
    string res;
    for (int i = (0); (1) > 0 ? i < (second) : i > (second); i += (1))
      res += char('0' + b[i]);
    return res;
  }
  template <class T>
  string to_string(T v) {
    bool f = 1;
    string res;
    for (auto& x : v) {
      if (!f) res += ' ';
      f = 0;
      res += to_string(x);
    }
    return res;
  }
  template <class A>
  void write(A x) {
    cout << to_string(x);
  }
  template <class H, class... T>
  void write(const H& h, const T&... t) {
    write(h);
    write(t...);
  }
  void print() { write("\n"); }
  template <class H, class... T>
  void print(const H& h, const T&... t) {
    write(h);
    if (sizeof...(t)) write(' ');
    print(t...);
  }
  void DBG() { cerr << "]" << endl; }
  template <class H, class... T>
  void DBG(H h, T... t) {
    cerr << to_string(h);
    if (sizeof...(t)) cerr << ", ";
    DBG(t...);
  }
  template <class T>
  void offset(long long o, T& x) {
    x += o;
  }
  template <class T>
  void offset(long long o, vector<T>& x) {
    for (auto& a : x) offset(o, a);
  }
  template <class T, size_t second>
  void offset(long long o, array<T, second>& x) {
    for (auto& a : x) offset(o, a);
  }
  mt19937 mt_rng(chrono::steady_clock::now().time_since_epoch().count());
  long long randint(long long a, long long b) {
    return uniform_int_distribution<long long>(a, b)(mt_rng);
  }
  template <class T, class U>
  void vti(vector<T>& v, U x, size_t n) {
    v = vector<T>(n, x);
  }
  template <class T, class U>
  void vti(vector<T>& v, U x, size_t n, size_t m...) {
    v = vector<T>(n);
    for (auto& a : v) vti(a, x, m);
  }
  const int d4i[4] = {-1, 0, 1, 0}, d4j[4] = {0, 1, 0, -1};
  const int d8i[8] = {-1, -1, 0, 1, 1, 1, 0, -1},
            d8j[8] = {0, 1, 1, 1, 0, -1, -1, -1};
  const int Max = 2e5 + 1;
  const double pi = 3.141592653589793238462;
  bool vis[Max] = {false};
  long long dp[Max] = {0};
  string s;
  void solve() {
    long long n, k;
    read(n, k);
    if (n == 1) {
      print(0);
      return;
    }
    if (k == 1) {
      print(n - 1);
      return;
    }
    long long c = 1;
    long long sum = 1;
    long long ans = 0;
    while (sum < k) {
      sum += min(c, k);
      ans++;
      c = sum;
    }
    long long ex = n - sum;
    ans += (ex + k - 1) / k;
    print(ans);
  }
  int32_t main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int t = 1;
    read(t);
    for (int i = (0); (1) > 0 ? i < (t) : i > (t); i += (1)) {
      solve();
    }
  }
  