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.*;
  import java.lang.*;
  import java.util.function.Supplier;
  
  import static java.lang.Math.*;
  
  // Sachin_2961 submission //
  public class Codeforces {
  
      static long[][]cnt;
      static void solve() {
  
          int l = fs.nInt(), r = fs.nInt();
          int n = r - l;
          long max = cnt[r][0] - cnt[l-1][0];
          for(int i=1;i<32;i++){
              max = max(max,cnt[r][i]-cnt[l-1][i]);
          }
          long ans = ((r-l+1)-max);
          out.println(ans);
      }
      static void preCompute(){
          cnt = new long[(int)2e5+1][32];
          cnt[1][0] = 1;
          for(int i=2;i<2e5+1;i++){
              for(int j=0;j<32;j++){
                  int mask = (1<<j);
                  if((i&mask)!=0){
                      cnt[i][j]=cnt[i-1][j]+1;
                  }else{
                      cnt[i][j] =cnt[i-1][j];
                  }
              }
          }
      }
      static class PairI{
          int f,s,w;
          PairI(int f,int s,int w){
              this.f = f;
              this.s = s;
              this.w = w;
          }
  
      }
      static class Pair{
          int f,s;
          Pair(int f,int s) {
              this.f = f;
              this.s = s;
          }
      }
      static boolean multipleTestCase = true;
      static FastScanner fs;
      static PrintWriter out;
      public static void main(String[]args){
          try{
              out = new PrintWriter(System.out);
              fs = new FastScanner();
              int tc = multipleTestCase?fs.nInt():1;
              preCompute();
              while (tc-->0)solve();
              out.flush();
              out.close();
          }catch (Exception e){
              e.printStackTrace();
          }
      }
      static class FastScanner {
          BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
          StringTokenizer st=new StringTokenizer("");
          String n() {
              while (!st.hasMoreTokens())
                  try {
                      st=new StringTokenizer(br.readLine());
                  } catch (IOException e) {
                      e.printStackTrace();
                  }
              return st.nextToken();
          }
          String Line()
          {
              String str = "";
              try
              {
                  str = br.readLine();
              }catch (IOException e)
              {
                  e.printStackTrace();
              }
              return str;
          }
          int nInt() {return Integer.parseInt(n()); }
          long nLong() {return Long.parseLong(n());}
          double nDouble(){return Double.parseDouble(n());}
          int[]aI(int n){
              int[]ar = new int[n];
              for(int i=0;i<n;i++)
                  ar[i] = nInt();
              return ar;
          }
      }
      public static void sort(int[] arr){
          ArrayList<Integer> ls = new ArrayList<>();
          for(int x: arr)
              ls.add(x);
          Collections.sort(ls);
          for(int i=0; i < arr.length; i++)
              arr[i] = ls.get(i);
      }
      public static void sort(long[] arr){
          ArrayList<Long> ls = new ArrayList<>();
          for(long x: arr)
              ls.add(x);
          Collections.sort(ls);
          for(int i=0; i < arr.length; i++)
              arr[i] = ls.get(i);
      }
  }