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.io.BufferedReader;
  import java.io.IOException;
  import java.io.InputStreamReader;
  import java.io.*;
  
  /* docstring*/
  public class b1615B {
      static FastScanner fs = new FastScanner();
      static PrintWriter fop = new PrintWriter(System.out);
      static StringBuilder sb = new StringBuilder();
      static int Max = (int) 3e5 + 1;
  
      public static void main(String[] args) {
          try {
  
              int T = fs.nextInt();
              int[][] bitInside = new int[30][Max + 1];
              for (int i = 1; i <= Max; i++) {
                  for (int j = 0; j < 30; j++) {
                      if ((i & (1 << j)) != 0)
                          bitInside[j][i]++;
                      bitInside[j][i] += bitInside[j][i - 1];
                  }
              }
              while (T-- > 0) {
                  // write your code here
                  int l = fs.nextInt() - 1;
                  int r = fs.nextInt();
                  int ans = r - l;
                  for (int i = 0; i < 30; i++) {
                      ans = Math.min(ans, (r - l) - (bitInside[i][r] - bitInside[i][l]));
                  }
                  sb.append(ans + "\n");
              }
              fop.println(sb);
              fop.flush();
          } catch (Exception e) {
              return;
          }
      }
  
      static class FastScanner {
          BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
          StringTokenizer st = new StringTokenizer("");
  
          String next() {
              while (!st.hasMoreTokens())
                  try {
                      st = new StringTokenizer(br.readLine());
                  } catch (IOException e) {
                      e.printStackTrace();
                  }
              return st.nextToken();
          }
  
          int nextInt() {
              return Integer.parseInt(next());
          }
  
          int[] readArray(int n) {
              int[] a = new int[n];
              for (int i = 0; i < n; i++)
                  a[i] = nextInt();
              return a;
          }
  
          long[] readLongArray(int n) {
              long[] a = new long[n];
              for (int i = 0; i < n; i++)
                  a[i] = nextLong();
              return a;
          }
  
          long nextLong() {
              return Long.parseLong(next());
          }
      }
  }
  