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.*;
  
  public class B {
  
      static FastScanner fs = new FastScanner();
      static Scanner scn = new Scanner(System.in);
      static PrintWriter pw = new PrintWriter(System.out);
      static StringBuilder sb = new StringBuilder("");
      static int K = 18;
      static int N = 200000;
      static int[] a, pre;
      static int t, n, s, max;
      static Pair[] pairs;
  
      public static void main(String[] args) {
          int[][] pre = new int[K][N + 2];
          for (int i = 0; i < K; i++) {
              for (int j = 0; j <= N; j++) {
                  pre[i][j + 1] = pre[i][j];
                  if ((j >> i & 1) == 0)
                      pre[i][j + 1]++;
              }
          }
          int t = fs.nextInt();
          for (int i = 0; i < t; i++) {
              int l = fs.nextInt(), r = fs.nextInt();
              r++;
              int ans = r - l;
              for (int j = 0; j < K; j++)
                  ans = Math.min(ans, pre[j][r] - pre[j][l]);
              sb.append(ans + "\n");
          }
          pw.print(sb.toString());
          pw.close();
      }
  
      static boolean ok(long x) {
  
          return false;
      }
  
      static void swap(ArrayList<Integer> x, ArrayList<Integer> y) {
          ArrayList<Integer> temp = new ArrayList<>();
          for (int i = 0; i < x.size(); i++)
              temp.add(x.get(i));
          for (int i = 0; i < y.size(); i++)
              x.add(y.get(i));
          for (int i = 0; i < temp.size(); i++)
              y.add(temp.get(i));
      }
  
      static void sort(int[] a) {
          ArrayList<Integer> al = new ArrayList<>();
          for (int i : a)
              al.add(i);
          Collections.sort(al);
          for (int i = 0; i < a.length; i++)
              a[i] = al.get(i);
      }
  
      static class Pair implements Comparable<Pair> {
          int first = 0;
          int second = 0;
  
          Pair(int first, int second) {
              this.first = first;
              this.second = second;
          }
  
          public int compareTo(Pair o) {
              return Integer.compare(first, o.first);
          }
      }
  
      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) {
                  }
              return st.nextToken();
          }
  
          int nextInt() {
              return Integer.parseInt(next());
          }
  
          long nextLong() {
              return Long.parseLong(next());
          }
  
          double nextDouble() {
              return Double.parseDouble(next());
          }
  
          int[] readArray(int n) {
              int[] a = new int[n];
              for (int i = 0; i < n; i++) {
                  a[i] = nextInt();
              }
              return a;
          }
      }
  }