description: You are given an array consisting of all integers from [l, r] inclusive. For example, if l = 2 and r = 5, the array would be [2, 3, 4, 5]. What's the minimum number of elements you can delete to make the [bitwise AND](https://en.wikipedia.org/wiki/Bitwise_operation#AND) of the array non-zero?
  
  A bitwise AND is a binary operation that takes two equal-length binary representations and performs the AND operation on each pair of the corresponding bits.
  
  Input
  
  The first line contains one integer t (1 ≤ t ≤ 10^4) — the number of test cases. Then t cases follow.
  
  The first line of each test case contains two integers l and r (1 ≤ l ≤ r ≤ 2 ⋅ 10^5) — the description of the array.
  
  Output
  
  For each test case, output a single integer — the answer to the problem.
  
  Example
  
  Input
  
  
  5
  1 2
  2 8
  4 5
  1 5
  100000 200000
  
  
  Output
  
  
  1
  3
  0
  2
  31072
  
  Note
  
  In the first test case, the array is [1, 2]. Currently, the bitwise AND is 0, as 1\ \& \ 2 = 0. However, after deleting 1 (or 2), the array becomes [2] (or [1]), and the bitwise AND becomes 2 (or 1). This can be proven to be the optimal, so the answer is 1.
  
  In the second test case, the array is [2, 3, 4, 5, 6, 7, 8]. Currently, the bitwise AND is 0. However, after deleting 4, 5, and 8, the array becomes [2, 3, 6, 7], and the bitwise AND becomes 2. This can be proven to be the optimal, so the answer is 3. Note that there may be other ways to delete 3 elements.
solution: import java.io.*;
  import java.util.*;
  
  public class new1{
  
      public static long gcd(long a, long b)
      {
          if (a == 0)
              return b;
            
          return gcd(b%a, a);
      }
  
  	
  	public static void main(String[] args)  throws IOException{
      	BufferedWriter output = new BufferedWriter(new OutputStreamWriter(System.out));
  		FastReader s = new FastReader();
  		int t = s.nextInt();
  		int n1 = 200005; int bit = 32;
  		int[][] arr = new int[n1][bit];
  		for(int i = 0; i < bit; i++) arr[0][i] = 1;
  		
  		
  		for(int i = 1; i < n1; i++) {
  			int num = i;
  			for(int j = 0; j < bit; j++) {
  				int val = num & (1 << j); 
  				if(val == 0) arr[i][j] = 1 + arr[i - 1][j];
  				else arr[i][j] = arr[i - 1][j];
  			}
  		}
  		
  		
  		
      	for(int z = 0; z < t; z++) {
      		int l = s.nextInt();
      		int r = s.nextInt();
      		int min = Integer.MAX_VALUE;
      		for(int i = 0; i < bit; i++) {
      			int val = arr[r][i];
      			if(l > 0) val = val - arr[l - 1][i];
      			min = Math.min(min, val);
      			//System.out.println(val + " " + i);
      		}
      		System.out.println(min);
      		
      		
      		
      		
      		
      	}
      	//output.flush();
  
      }
  }
  
  
  class FastReader {
      BufferedReader br;
      StringTokenizer st;
      public FastReader() {
          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();
      }
   
      public 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;
  }}