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.FileInputStream;
  import java.io.IOException;
  import java.io.InputStreamReader;
  import java.io.PrintWriter;
  import java.util.ArrayList;
  import java.util.Arrays;
  import java.util.HashMap;
  import java.util.Map;
  import java.util.StringTokenizer;
  
  public class Solution {
      // VM options: -Xmx1024m -Xss1024m
  
      private void solve() throws IOException {
          int l = nextInt();
          int r = nextInt();
          int MAX_BIT = 19;
          int res = Integer.MAX_VALUE;
          for (int i = 0; i <= MAX_BIT; i++) {
              int cnt1 = cnt(r, i) - cnt(l - 1, i);
              if (cnt1 > 0) {
                  res = Math.min(res, r - l + 1 - cnt1);
              }
          }
          println(res);
      }
  
      private int cnt(int to, int bit) {
          int groupSize = 1 << (bit + 1);
          return (to / groupSize * groupSize / 2) + (Math.max(to % groupSize + 1 - groupSize / 2, 0));
      }
  
      private static final String inputFilename = "input.txt";
      private static final String outputFilename = "output.txt";
      private BufferedReader in;
      private StringTokenizer line;
      private PrintWriter out;
      private final boolean isDebug;
  
      private Solution(boolean isDebug) {
          this.isDebug = isDebug;
      }
  
      public static void main(String[] args) throws IOException {
          new Solution(Arrays.asList(args).contains("DEBUG_MODE")).run(args);
      }
  
      private void run(String[] args) throws IOException {
          if (isDebug) {
              in = new BufferedReader(new InputStreamReader(new FileInputStream(inputFilename)));
  //            in = new BufferedReader(new InputStreamReader(System.in));
          } else {
              in = new BufferedReader(new InputStreamReader(System.in));
          }
          out = new PrintWriter(System.out);
  //        out = new PrintWriter(outputFilename);
  
  
  //        int t = isDebug ? nextInt() : 1;
  //        int t = 1;
  
          int t = nextInt();
          for (int i = 0; i < t; i++) {
  //            out.print("Case #" + (i + 1) + ": ");
              solve();
              out.flush();
          }
  
          in.close();
          out.flush();
          out.close();
      }
  
      private void println(Object... objects) {
          boolean isFirst = true;
          for (Object o : objects) {
              if (!isFirst) {
                  out.print(" ");
              } else {
                  isFirst = false;
              }
              out.print(o.toString());
          }
          out.println();
      }
  
      private int[] nextIntArray(int n) throws IOException {
          int[] res = new int[n];
          for (int i = 0; i < n; i++) {
              res[i] = nextInt();
          }
          return res;
      }
  
      private long[] nextLongArray(int n) throws IOException {
          long[] res = new long[n];
          for (int i = 0; i < n; i++) {
              res[i] = nextLong();
          }
          return res;
      }
  
      private int nextInt() throws IOException {
          return Integer.parseInt(nextToken());
      }
  
      private long nextLong() throws IOException {
          return Long.parseLong(nextToken());
      }
  
      private double nextDouble() throws IOException {
          return Double.parseDouble(nextToken());
      }
  
      private String nextToken() throws IOException {
          while (line == null || !line.hasMoreTokens()) {
              line = new StringTokenizer(in.readLine());
          }
          return line.nextToken();
      }
  
      private static void assertPredicate(boolean p) {
          if (!p) {
              throw new RuntimeException();
          }
      }
  
      private static void assertPredicate(boolean p, String message) {
          if (!p) {
              throw new RuntimeException(message);
          }
      }
  
      private static void assertNotEqual(int unexpected, int actual) {
          if (actual == unexpected) {
              throw new RuntimeException("assertNotEqual: " + unexpected + " == " + actual);
          }
      }
  
      private static void assertEqual(int expected, int actual) {
          if (expected != actual) {
              throw new RuntimeException("assertEqual: " + expected + " != " + actual);
          }
      }
  }
  