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.BufferedReader;
  import java.io.IOException;
  import java.io.InputStreamReader;
  import java.io.PrintWriter;
  import java.util.Arrays;
  import java.util.StringTokenizer;
  
  public class Main {
  
      BufferedReader in;
      PrintWriter out;
  
      Main() {
          in = new BufferedReader(new InputStreamReader(System.in));
          out = new PrintWriter(System.out);
      }
  
      void close() throws IOException {
          in.close();
          out.flush();
          out.close();
      }
  
      public static void main(String[] args) throws IOException {
          Main m = new Main();
          m.solve();
  //        m.test();
          m.close();
      }
  
      void test() {
          setup();
          while (true) {
              int l = (int) (Math.random() * 200000 + 1);
              int r = (int) (Math.random() * 200000 + 1);
              if (l > r) {
                  continue;
              }
  //            l = 15505;
  //            r = 148149;
              int a1 = cal1(l, r);
              int a2 = cal2(l, r);
  
              assert (a1 == a2);
          }
      }
  
      int maxn = 200001;
  
      int[][] cnts = new int[maxn][20];
  
      int cal1(int l, int r) {
          int[] cnt = new int[20];
          for (int i = 0; i < 20; i++) {
              cnt[i] = cnts[r][i] - cnts[l - 1][i];
          }
          Arrays.sort(cnt);
          int last = cnt[cnt.length - 1];
          int n = r - l + 1;
          int ans = n - last;
          return ans;
      }
  
      void setup() {
          int[] cnt = new int[20];
          for (int i = 1; i < maxn; i++) {
              String s = Integer.toBinaryString(i);
              int len = s.length();
              for (int j = 0; j < len; j++) {
                  char c = s.charAt(len - 1 - j);
                  if (c == '1') {
                      cnt[j]++;
                  }
              }
              cnts[i] = cnt.clone();
          }
      }
  
      int cal2(int l, int r) {
          int[] cnts = new int[20];
          for (int i = l; i <= r; i++) {
              String s = Integer.toBinaryString(i);
              int len = s.length();
              for (int j = len - 1; j >= 0; j--) {
                  char c = s.charAt(len - 1 - j);
                  if (c == '1') {
                      cnts[j]++;
                  }
              }
          }
          Arrays.sort(cnts);
          int last = cnts[cnts.length - 1];
          int n = r - l + 1;
          int ans = n - last;
          return ans;
      }
  
      void solve() throws IOException {
          setup();
          int t = Integer.parseInt(in.readLine());
          while (t > 0) {
              t--;
              StringTokenizer st = new StringTokenizer(in.readLine());
              int l = Integer.parseInt(st.nextToken());
              int r = Integer.parseInt(st.nextToken());
              int ans = cal1(l, r);
              out.append(String.format("%d\n", ans));
          }
      }
  
  }