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.OutputStream;
  import java.io.IOException;
  import java.io.InputStream;
  import java.io.PrintWriter;
  import java.io.OutputStream;
  import java.io.Writer;
  import java.io.IOException;
  import java.util.InputMismatchException;
  import java.io.BufferedReader;
  import java.io.InputStreamReader;
  import java.io.InputStream;
  
  /**
   * Built using CHelper plug-in
   * Actual solution is at the top
   *
   * @author Nipuna Samarasekara
   */
  public class Main {
      public static void main(String[] args) {
          InputStream inputStream = System.in;
          OutputStream outputStream = System.out;
          FastScanner in = new FastScanner(inputStream);
          FastPrinter out = new FastPrinter(outputStream);
          TaskB solver = new TaskB();
          solver.solve(1, in, out);
          out.close();
      }
  
      static class TaskB {
          static int ans(int r, int pos) {
              int ans = 0;
              int vv = (r >> (pos + 1));
              ans += (vv - 1) * (1 << pos);
              if ((r & (1 << pos)) > 0) {
                  ans += (r & ((1 << pos) - 1)) + 1;
              }
              return r + 1 - ans;
          }
  
          public void solve(int testNumber, FastScanner in, FastPrinter out) {
              int t = in.nextInt();
              while (t-- > 0) {
                  int l = in.nextInt();
                  int r = in.nextInt();
                  int ans = r - l + 1;
                  for (int p = 0; p < 20; p++) {
                      int ss = ans(r, p) - ans(l - 1, p);
                      ans = Math.min(ans, ss);
                  }
                  out.println(ans);
              }
          }
  
      }
  
      static class FastPrinter extends PrintWriter {
          public FastPrinter(OutputStream out) {
              super(out);
          }
  
          public FastPrinter(Writer out) {
              super(out);
          }
  
      }
  
      static class FastScanner extends BufferedReader {
          public FastScanner(InputStream is) {
              super(new InputStreamReader(is));
          }
  
          public int read() {
              try {
                  int ret = super.read();
                  //            if (isEOF && ret < 0) {
                  //                throw new InputMismatchException();
                  //            }
                  //            isEOF = ret == -1;
                  return ret;
              } catch (IOException e) {
                  throw new InputMismatchException();
              }
          }
  
          static boolean isWhiteSpace(int c) {
              return c >= 0 && c <= 32;
          }
  
          public int nextInt() {
              int c = read();
              while (isWhiteSpace(c)) {
                  c = read();
              }
              int sgn = 1;
              if (c == '-') {
                  sgn = -1;
                  c = read();
              }
              int ret = 0;
              while (c >= 0 && !isWhiteSpace(c)) {
                  if (c < '0' || c > '9') {
                      throw new NumberFormatException("digit expected " + (char) c + " found");
                  }
                  ret = ret * 10 + c - '0';
                  c = read();
              }
              return ret * sgn;
          }
  
          public String readLine() {
              try {
                  return super.readLine();
              } catch (IOException e) {
                  return null;
              }
          }
  
      }
  }
  
  