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.

//package com.company;

import java.util.*;
import java.lang.*;
import java.io.*;

public final class Main {

    FastReader s;

    public static void main(String[] args) throws java.lang.Exception {

        new Main().run();

    }

    void run() {
        s = new FastReader();
        solve();
    }




    StringBuffer sb;
static long [][] cntBit ;

    void solve() {

        sb = new StringBuffer();

        cntBit = new long[20][2000_01];
        call();
        for (int T = s.nextInt(); T > 0; T--)
        {

            start();


        }


        System.out.print(sb);

    }

    void call()
    {
        for(int i = 0; i<20; i++)
        {
            for(int k = 1; k<=2000_00; k++)
            {
                if(((k>>i)&1) == 0)
                {
                    cntBit[i][k]++;

                }
                cntBit[i][k]+=cntBit[i][k-1];
            }
        }
    }

    void start()
    {

     int l = s.nextInt();
     int r = s.nextInt();

//      int cntbit[] = new int[20];

      long min = Integer.MAX_VALUE;
        for(int i=0; i<20; i++)
        {
            long h = cntBit[i][r]-cntBit[i][l-1];
            min = Math.min(min,h);
        }
      sb.append(min+"\n");



    }




    class Pair {
        int a;
        int b;

        public Pair(int a, int b) {
            this.a = a;
            this.b = b;
        }

        void print() {
            System.out.println(a + " " + b);
        }

    }

    class segmentTree{
         int[] tree;
         int n;
         public segmentTree(int[] nums) {
             if (nums.length > 0) {
                 n = nums.length;
                 tree = new int[n * 2];
                 buildTree(nums);
             }
         }

         private void buildTree(int[] nums) {
             for (int i = n, j = 0;  i < 2 * n; i++,  j++)
                 tree[i] = nums[j];
             for (int i = n - 1; i > 0; --i)
                 tree[i] = tree[i * 2] + tree[i * 2 + 1];
         }

         void update(int pos, int val) {
             pos += n;
             tree[pos] = val;
             while (pos > 0) {
                 int left = pos;
                 int right = pos;
                 if (pos % 2 == 0) {
                     right = pos + 1;
                 } else {
                     left = pos - 1;
                 }
                 // parent is updated after child is updated
                 tree[pos / 2] = tree[left] + tree[right];
                 pos /= 2;
             }
         }

         public int sumRange(int l, int r) {
             // get leaf with value 'l'
             l += n;
             // get leaf with value 'r'
             r += n;
             int sum = 0;
             while (l <= r) {
                 if ((l % 2) == 1) {
                     sum += tree[l];
                     l++;
                 }
                 if ((r % 2) == 0) {
                     sum += tree[r];
                     r--;
                 }
                 l /= 2;
                 r /= 2;
             }
             return sum;
         }

     }

    int gcd(int a, int b) {
        if (b == 0)
            return a;
        return gcd(b, a % b);
    }

    long gcd(long a, long b) {
        if (b == 0)
            return a;
        return gcd(b, a % b);
    }

    long power(long x, long y, long p) {
        long res = 1;


        x = x % p;

        while (y > 0) {

            if ((y & 1) > 0)
                res = (res * x) % p;


            y = y >> 1;
            x = (x * x) % p;
        }
        return res;
    }

    int find(int dsu[], int i) {
        if (dsu[i] == i)
            return i;
        dsu[i] = find(dsu, dsu[i]);
        return dsu[i];
    }

    void union(int dsu[], int i, int j) {
        int a = find(dsu, i);
        int b = find(dsu, j);
        dsu[a] = b;
    }

    static void sort(int[] a) {
        ArrayList<Integer> l = new ArrayList<>();
        for (int i : a)
            l.add(i);
        Collections.sort(l);
        for (int i = 0; i < a.length; i++)
            a[i] = l.get(i);
    }

    static void sort(long[] a) {
        ArrayList<Long> l = new ArrayList<>();
        for (long i : a)
            l.add(i);
        Collections.sort(l);
        for (int i = 0; i < a.length; i++)
            a[i] = l.get(i);
    }

    static String sort(String s) {
        Character ch[] = new Character[s.length()];
        for (int i = 0; i < s.length(); i++) {
            ch[i] = s.charAt(i);
        }
        Arrays.sort(ch);
        StringBuffer st = new StringBuffer("");
        for (int i = 0; i < s.length(); i++) {
            st.append(ch[i]);
        }
        return st.toString();
    }

    // long array input
    public long[] longArr(int len) {
        // long arr input
        long[] arr = new long[len];
        String[] strs = s.nextLine().trim().split("\\s+");
        for (int i = 0; i < len; i++) {
            arr[i] = Long.parseLong(strs[i]);

        }
        return arr;
    }

    // int arr input
    public int[] intArr(int len) {
        // long arr input
        int[] arr = new int[len];
        String[] strs = s.nextLine().trim().split("\\s+");
        for (int i = 0; i < len; i++) {
            arr[i] = Integer.parseInt(strs[i]);

        }
        return arr;
    }

    public void printArray(int[] A) {
        System.out.println(Arrays.toString(A));
    }

    public void printArray(long[] A) {
        System.out.println(Arrays.toString(A));
    }



    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;
        }
    }

}
