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.io.BufferedReader;
  import java.io.IOException;
  import java.io.InputStreamReader;
  import java.io.PrintWriter;
  import java.util.ArrayList;
  import java.util.Collections;
  import java.util.StringTokenizer;
  
  public class Solve {
  
  	static long MOD = 998244353L;
  	static long INF = 1000_000_000_000_000L + 100;
  	static boolean isPrime[];
  
  	public static void main(String[] args) throws Exception {
  		Scanner sc = new Scanner();
  		PrintWriter pw = new PrintWriter(System.out);
  
  		int t = sc.nextInt();
  		while (t-- > 0) {
  			long n = sc.nextLong();
  			long k = sc.nextLong();
  
  			long start = 1L;
  			long hours = 0L;
  
  			while (start < k && start < n) {
  				start *= 2L;
  				hours++;
  
  			}
  			if (start >= n) {
  				pw.println(hours);
  			} else {
  
  				hours = hours + (n - start + k - 1) / k;
  
  				pw.println(hours);
  
  			}
  
  		}
  		pw.flush();
  
  	}
  
  	static int LowerBound(int a[], int x, int start) { // x is the target value or key
  		int ans = -1;
  
  		int l = start, r = a.length;
  		while (l + 1 < r) {
  			System.out.println("lolk");
  
  			int m = (l + r) >>> 1;
  			if (a[m] >= x) {
  				ans = m;
  				r = m;
  			} else
  				l = m;
  		}
  		return ans;
  	}
  
  	static int UpperBound(int a[], int x, int start) {// x is the key or target value
  		int ans = -1;
  
  		int l = start, r = a.length;
  		while (l + 1 < r) {
  			int m = (l + r) >>> 1;
  			if (a[m] <= x) {
  				ans = m;
  				l = m;
  			} else
  				r = m;
  		}
  		return ans;
  	}
  
  	static public boolean[] sieve(int n) {
  		boolean prime[] = new boolean[n + 1];
  		for (int i = 0; i <= n; i++)
  			prime[i] = true;
  
  		for (int p = 2; p * p <= n; p++) {
  			// If prime[p] is not changed, then it is a
  			// prime
  			if (prime[p] == true) {
  				// Update all multiples of p
  				for (int i = p * p; i <= n; i += p)
  					prime[i] = false;
  			}
  		}
  		return prime;
  
  	}
  
  	public static ArrayList<Integer> primeFactors(int n) {
  		ArrayList<Integer> set = new ArrayList<Integer>();
  
  		// Print the number of 2s that divide n
  		while (n % 2 == 0) {
  			n /= 2;
  			set.add(2);
  		}
  
  		// n must be odd at this point. So we can
  		// skip one element (Note i = i +2)
  		for (int i = 3; i * i <= n; i += 2) {
  			// While i divides n, print i and divide n
  			while (n % i == 0) {
  				n /= i;
  				set.add(i);
  			}
  		}
  
  		if (n > 1)
  			set.add(n);
  
  		return set;
  
  	}
  
  	static int gcd(int a, int b) {
  		if (a == 0)
  			return b;
  		if (b == 0)
  			return a;
  
  		return gcd(b, a % b);
  
  	}
  
  	public static int[] swap(int data[], int left, int right) {
  
  		// Swap the data
  		int temp = data[left];
  		data[left] = data[right];
  		data[right] = temp;
  
  		// Return the updated array
  		return data;
  	}
  
  	public static long[] euclidExtended(long a, long b) {
  		if (b == 0) {
  			long ar[] = new long[] { 1, 0 };
  			return ar;
  		}
  		long ar[] = euclidExtended(b, a % b);
  		long temp = ar[0];
  		ar[0] = ar[1];
  		ar[1] = temp - (a / b) * ar[1];
  		return ar;
  	}
  
  	public static long modInverse(long a, long m) {
  		long ar[] = euclidExtended(a, m);
  		return ((ar[0] % m) + m) % m;
  	}
  
  	// Fermat Theorem
  	public static long ncr(int n, int r, long[] fact) {
  		if (n == r)
  			return 1;
  		if (r == 1)
  			return n;
  		if (n == 0 || r == 0)
  			return 1;
  		return (fact[n] * modInverse(((long) fact[n - r]) * fact[r], MOD)) % MOD;
  	}
  
  	static void sort(int[] a) {
  		ArrayList<Integer> l = new ArrayList<>();
  		for (int i : a)
  			l.add(i);
  		Collections.sort(l);
  		for (int i = 0; i < a.length; i++)
  			a[i] = l.get(i);
  	}
  
  }
  
  class Pair {
  	int x, y;
  
  	Pair(int x, int y) {
  		this.x = x;
  		this.y = y;
  	}
  
  }
  
  class SegTree {
  	int leftmost, rightmost, sum;
  	SegTree lChild, rChild;
  
  	public SegTree(int leftmost, int rightmost) {
  		this.leftmost = leftmost;
  		this.rightmost = rightmost;
  	}
  
  	public void update(int index, int val) {
  		sum++;
  		if (leftmost == rightmost) {
  			return;
  		}
  		if (lChild == null)
  			makeKids();
  		if (index <= lChild.rightmost)
  			lChild.update(index, val);
  		else
  			rChild.update(index, val);
  	}
  
  	public void makeKids() {
  		int mid = (leftmost + rightmost) / 2;
  		lChild = new SegTree(leftmost, mid);
  		rChild = new SegTree(mid + 1, rightmost);
  	}
  
  	public int query(int l, int r) {
  		if (l <= leftmost && r >= rightmost)
  			return sum;
  		if (l > rightmost || r < leftmost)
  			return 0;
  		if (lChild == null)
  			return 0;
  		return lChild.query(l, r) + rChild.query(l, r);
  	}
  }
  
  class UnionFind {
  	int[] p, rank, setSize;
  	int numSets;
  
  	public UnionFind(int N) {
  		p = new int[numSets = N];
  		rank = new int[N];
  		setSize = new int[N];
  		for (int i = 0; i < N; i++) {
  			p[i] = i;
  			setSize[i] = 1;
  		}
  	}
  
  	public int findSet(int i) {
  		return p[i] == i ? i : (p[i] = findSet(p[i]));
  	}
  
  	public boolean isSameSet(int i, int j) {
  		return findSet(i) == findSet(j);
  	}
  
  	public void unionSet(int i, int j) {
  		if (isSameSet(i, j))
  			return;
  		numSets--;
  		int x = findSet(i), y = findSet(j);
  		if (rank[x] > rank[y]) {
  			p[y] = x;
  			setSize[x] += setSize[y];
  		} else {
  			p[x] = y;
  			setSize[y] += setSize[x];
  			if (rank[x] == rank[y])
  				rank[y]++;
  		}
  	}
  
  	public int numDisjointSets() {
  		return numSets;
  	}
  
  	public int sizeOfSet(int i) {
  		return setSize[findSet(i)];
  	}
  }
  
  class Scanner {
  	BufferedReader br;
  	StringTokenizer st;
  
  	Scanner() {
  		br = new BufferedReader(new InputStreamReader(System.in));
  	}
  
  	String next() throws IOException {
  		while (st == null || !st.hasMoreElements())
  			st = new StringTokenizer(br.readLine());
  		return st.nextToken();
  	}
  
  	int nextInt() throws NumberFormatException, IOException {
  		return Integer.parseInt(next());
  	}
  
  	int[] nextIntArray(int n) throws NumberFormatException, IOException {
  		int a[] = new int[n];
  		for (int i = 0; i < n; i++)
  			a[i] = Integer.parseInt(next());
  		return a;
  	}
  
  	long nextLong() throws NumberFormatException, IOException {
  		return Long.parseLong(next());
  	}
  
  	long[] nextLongArray(int n) throws NumberFormatException, IOException {
  		long a[] = new long[n];
  		for (int i = 0; i < n; i++)
  			a[i] = Long.parseLong(next());
  		return a;
  	}
  
  	double nextDouble() throws NumberFormatException, IOException {
  		return Double.parseDouble(next());
  	}
  }