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.
import java.util.*;
import java.io.*;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Scanner;
import java.util.StringTokenizer;
 
public class Test{
 
        static FastReader scan;
 
        static void solve(){
            int l=scan.nextInt();
            int r=scan.nextInt();
            int ans=r-l;
            for(int i=0;i<=18;i++){
                ans=Math.min(dp[r][i]-dp[l-1][i],ans);
            }
            System.out.println(ans);

 
        }
        static int[][]dp=new int[200001][19];
        public static void main (String[] args) throws java.lang.Exception{
            scan=new FastReader();
            int t=scan.nextInt();
            for(int i=18;i>=0;i--){
                int count=0;
                for(int j=1;j<=200000;j++){
                    if(((j>>i)&1)==0)count++;
                    dp[j][18-i]=count;
                }
            }
            while(t-->0){
                solve();
            }
        }
 
        static boolean sq(int i){
            int temp=(int)Math.sqrt(i);
            return temp*temp==i;
        }
 
        static boolean cb(int i){
            int temp=(int)Math.cbrt(i);
            return temp*temp*temp==i;
        }
 
        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;
            }
        }
 
        static class Pair implements Comparable<Pair>{
            int e;
            int wt;
            Pair(int x,int y){
                this.e=x;
                this.wt=y;
            }
            @Override
            public int compareTo(Pair x){
                return (int)(x.wt-this.wt);
            }
        }        
 
        static void printLong(long []arr){
            for(long x:arr)System.out.print(x+" ");
        }
 
        static void printInt(int []arr){
            for(int x:arr)System.out.print(x+" ");
        }
 
        static void scanInt(int []arr){
            for(int i=0;i<arr.length;i++){
                arr[i]=scan.nextInt();
            }
        }
 
        static void scanLong(long []arr){
            for(int i=0;i<arr.length;i++){
                arr[i]=scan.nextLong();
            }
        }
 
        static long gcd(long a, long b){
            if (b == 0)
                return a;
            
            return gcd(b, a % b);
        }   
 
        static long power(long x, long y, long mod){
            long res = 1; 
        
            x = x % mod; 
         
            if (x == 0)
              return 0; 
         
            while (y > 0){              
                if ((y & 1) != 0)
                res = (res * x) % mod;
              
                y = y >> 1; 
                x = (x * x) % mod;
            }
                return res;
        }
 
        static long add(long a,long b,long mod){
            a = a % mod; 
            b = b % mod; 
            return (((a + b) % mod) + mod) % mod;
        }
 
        static long sub(long a, long b,long mod){
            a = a % mod; 
            b = b % mod; 
            return (((a - b) % mod) + mod) % mod;
        }
 
        static long mul(long a, long b,long mod){
            a = a % mod; 
            b = b % mod; 
            return (((a * b) % mod) + mod) % mod;
        }
        
 
        static long mminvprime(long a, long b,long mod) {
            return power(a, b - 2,mod);
        }
}