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.*;
  import java.math.BigInteger;
  import java.nio.charset.StandardCharsets;
  	
  public class Main {
  		private static FS sc = new FS();
  		
  		private static class FS {
  			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());
  			}
  		}
  		
  		private static class extra {
  			
  			static int[] intArr(int size) {
  				int[] a = new int[size];
  				for(int i = 0; i < size; i++) a[i] = sc.nextInt();
  				return a;
  			}
  			
  			static long[] longArr(int size) {
  				Scanner scc = new Scanner(System.in);
  				long[] a = new long[size];
  				for(int i = 0; i < size; i++) a[i] = sc.nextLong();
  				return a;
  			}
  			
  			static long intSum(int[] a) {
  				long sum = 0; 
  				for(int i = 0; i < a.length; i++) {
  					sum += a[i];
  				}
  				return sum;
  			}
  			
  			static long longSum(long[] a) {
  				long sum = 0; 
  				for(int i = 0; i < a.length; i++) {
  					sum += a[i];
  				}
  				return sum;
  			}
  			
  			static LinkedList[] graphD(int vertices, int edges) {
  				LinkedList<Integer>[] temp = new LinkedList[vertices+1];
  				for(int i = 0; i <= vertices; i++) temp[i] = new LinkedList<>();
  				for(int i = 0; i < edges; i++) {
  					int x = sc.nextInt();
  					int y = sc.nextInt();
  					temp[x].add(y);
  				}
  				return temp;
  			}
  			
  			static LinkedList[] graphUD(int vertices, int edges) {
  				LinkedList<Integer>[] temp = new LinkedList[vertices+1];
  				for(int i = 0; i <= vertices; i++) temp[i] = new LinkedList<>();
  				for(int i = 0; i < edges; i++) {
  					int x = sc.nextInt();
  					int y = sc.nextInt();
  					temp[x].add(y);
  					temp[y].add(x);
  				}
  				return temp;
  			}
  			
  			static void printG(LinkedList[] temp) { for(LinkedList<Integer> aa:temp) System.out.println(aa); }
  			
  			static long cal(long val, long pow, long mod) {
  				if(pow == 0) return 1;
  				long res = cal(val, pow/2, mod);
  				
  				long ret = (res*res)%mod;
  				if(pow%2 == 0) return ret;
  				return (val*ret)%mod;
  			}
  			
  			static long gcd(long a, long b) { return b == 0 ? a:gcd(b, a%b); }
  			
  		}
  		
  		static int mod = (int) 1e9;
  		
  		static LinkedList<Integer>[] temp, idx;
  		static long inf = (long) Long.MAX_VALUE;
  //		static long inf = Long.MAX_VALUE;
  //		static int max;
  		
  		public static void main(String[] args) { 
  			int t = sc.nextInt();
  //			int t = 1;
  			StringBuilder ret = new StringBuilder();
  			int size = (int) 2e5 + 100;
  			int[][] dp = new int[size][20];
  			for(int i = 0; i < 20; i++) {
  				int value = 1 << i, count = 0;
  				for(int j = 1; j < size; j++) {
  					if((value & j) != 0) count++;
  					dp[j][i] = count;
  				}
  			}
  			while(t-- > 0) {
  				int l = sc.nextInt(), r = sc.nextInt();
  				int min = Integer.MIN_VALUE;
  				for(int i = 0; i < 20; i++) {
  					min = Math.max(min, dp[r][i]-dp[l-1][i]);
  				}
  				ret.append(((r-l+1) - min) + "\n");
  			}
  			System.out.println(ret);
  		}
  
  	}
  
  	
  	
  
  
  	
  	
  	
  