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.util.StringTokenizer;
  import java.io.*;
  import java.util.*;
   
  public class codeforces {
  	static class FastReader {
  		BufferedReader br;
  		StringTokenizer st;
   
  		public FastReader() {
  			br = new BufferedReader(new InputStreamReader(System.in));
  		}
   
  		String next() {
  			while (st == null || !st.hasMoreElements()) {
  				try {
  					st = new StringTokenizer(br.readLine());
  				} catch (IOException e) {
  					e.printStackTrace();
  				}
  			}
  			return st.nextToken();
  		}
   
  		int nextInt() {
  			return Integer.parseInt(next());
  		}
   
  		long nextLong() {
  			return Long.parseLong(next());
  		}
   
  		double nextDouble() {
  			return Double.parseDouble(next());
  		}
   
  		String nextLine() {
  			String str = "";
  			try {
  				str = br.readLine();
  			} catch (IOException e) {
  				e.printStackTrace();
  			}
  			return str;
  		}
  	}
   
    
  	public static void main(String args[]) {
  		if (System.getProperty("ONLINE_JUDGE") == null) {
    			// Input is a file
    			try {
  				System.setIn(new FileInputStream("input.txt"));
  				System.setOut(new PrintStream(new FileOutputStream("output.txt")));
  			} catch (Exception e) {
  				System.err.println("Error");
  			}
  		} else {
    			// Input is System.in
  		}
  
  		FastReader sc = new FastReader();
  		// Scanner sc = new Scanner(System.in);
  		//System.out.println(java.time.LocalTime.now());
  
  		StringBuilder sb = new StringBuilder();
  		final int size = 2*100000;
  		int[][] arr = new int[size+1][32];
  
  		for(int i = 0; i<32; i++){
  			for(int j = 1; j<=size; j++){
  				if(((j >> i) & 1) == 1){
  					arr[j][i] = 1;
  				}
  				arr[j][i] += arr[j-1][i];
  			}
  		}
  
  
  		int t = sc.nextInt();
  		while(t>0) {
  			int l = sc.nextInt();
  			int r = sc.nextInt();
  			
  
  			int max = Integer.MIN_VALUE;
  
  			for(int i = 0; i<32; i++){
  				int k = arr[r][i] - arr[l-1][i];
  				max = Math.max(max, k);
  			}
  
  			int ans = r-l+1 - max;
  			sb.append(ans + "\n");
  			
  			t--;
  		}
  		
  		System.out.println(sb);
  		
   
  		
      }
  	
  	
   
   
   
   
  	//////////nCr////////////////////////////////////////
  		
  	 
  		
  	 
  	 
  	///////// SUM OF EACH DIGIT OF A NUMBER ///////////////
  	public static long digSum(long a) {
  		long sum = 0;
  		while(a>0) {
  			sum += a%10;
  			a /= 10;
  		}
  		
  		return sum;
  	}
  	 
  	///////// TO CHECK NUMBER IS PRIME OR NOT ///////////////
  	public static boolean isPrime(int n) {
  		if(n<=1)return false;
  		if(n <= 3)return true;
  		if(n%2==0 || n%3==0)return false;
  		
  		for(int i = 5; i*i<=n; i+=6) {
  			if(n%i == 0 || n%(i+2) == 0)return false;
  		}
  		
  		return true;
  	}
  	 
  	///////// NEXT PRIME NUMBER BIGGER THAN GIVEN NUMBER ///////////////
  	public static int nextPrime(int n) {
  		while(true) {
  			n++;
  			if(isPrime(n)) break;
  				
  		}
  		
  		return n;
  	}
  	 
  	///////// GCD  ///////////////
  	public static int gcd(int a, int b) {
  		if(b == 0)return a;
  		
  		return gcd(b, a%b);
  	}
  	 
  	///////// LCM ///////////////
  	public static int lcm(int a, int b) {
  		return (a*b)/gcd(a,b);
  	}
  
  	///////// IS POWER OF 2 ///////////////
  	public static boolean isPowerOfTwo (int x){
  	  /* First x in the below expression is
  	    for the case when x is 0 */
  	    return x!=0 && ((x&(x-1)) == 0);
  	         
  	}
  }