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.util.*;
  import java.lang.*;
  import java.io.*;
  
  public class Practice2 {
      static 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();
          }
   
          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;
          }
      }
  //////////////////////////////Input///////////////////////////////
  static void Input(){
   
     try {
      FileOutputStream output=new FileOutputStream("output2.txt");
      PrintStream out=new PrintStream(output);
      //Diverting the output stream into file "temp.out".Comment the below line to use console
      System.setOut(out);
      
      InputStream input=new FileInputStream("input.txt");
      //Diverting the input stream into file "temp.in".Comment the below line to use console
      System.setIn(input);
      
     } catch (FileNotFoundException e) {
      e.printStackTrace();
     }
  }
  //////////////////////////////////////////////////////////////////
  static class Node{
      Node arr[];
      int data;
      Node(int n,int data){
          arr=new Node[n];
          this.data=data;
      }
  }
  static void inorder(Node node){
      if(node==null){
          return;
      }
      int c=node.arr.length;
      for(int i=0;i<c-1;i++){
          inorder(node.arr[i]);
      }
      System.out.println(node.data);
      inorder(node.arr[c-1]);
  }
  static void rootToNode(Node root,Node x){
      
  }
  static void LCA(Node root,Node a,Node b){
  
  }
      static long findArea(double a, double b, double c)
      {
          // Length of sides must be positive and sum of any two sides
          // must be smaller than third side.
          if (a < 0 || b < 0 || c <0 || (a+b <= c) ||
              a+c <=b || b+c <=a)
          {
              System.out.println("Not a valid triangle");
          }
          double s = (a+b+c)/2;
          double ans=(double)Math.sqrt(s*(s-a)*(s-b)*(s-c))*2;
          //System.out.println(ans);
          ans=Math.round((ans * 100.00) / 100.00);
          return (long)Math.ceil(ans);
      }
      static double distance(long x1, long y1, long x2, long y2)
  {
      // Calculating distance
      return Math.sqrt(Math.pow(x2 - x1, 2) +
                  Math.pow(y2 - y1, 2) * 1.00);
  }
  static void ans(int l,int r,int arr[][]){
      int maxElement = 0;
  
      for(int i=0;i<20;i++){
          maxElement = Math.max(maxElement, arr[r][i] - arr[l - 1][i]);
      }
      System.out.println(r - l + 1 - maxElement);
  }
  //////////////////////////////////////////////////////////////////
  public static void main(String[] args) {
      //Input();    
      FastReader sc = new FastReader();
      int t=sc.nextInt();
      int arr[][]=new int[200001][20];
      for(int i=0;i<=200000;i++){
          int  check = i, idx = 0;
          while(check!=0){
              arr[i][idx++] += (check % 2);
              check /= 2;
          }
          for(int j=0;j<20;j++){
              if(i!=0){
              arr[i][j] += arr[i - 1][j];
          }
          }
      }
      for(int test=0;test<t;test++){
          int l=sc.nextInt();
          int r=sc.nextInt();
          ans(l,r,arr);
  
  }
  }    
  }