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.io.*;
import java.util.StringTokenizer;

public class TaskB {

    public static void main(String[] arg) throws FileNotFoundException {
        final FastScanner in = new FastScanner(System.in);
        final PrintWriter out = new PrintWriter(System.out);
        final int T = in.nextInt();
        StringBuilder sb = new StringBuilder();
        for (int t = 1; t <= T; t++) {
            final int l = in.nextInt();
            final int r = in.nextInt();
            Solution sol = new Solution(l, r);
            sb.append(sol.solution()).append('\n');
        }
        out.print(sb.toString());
        out.flush();
        out.close();
        in.close();
    }

    public static class Solution {
        private final int L;
        private final int R;

        public Solution(int l, int r) {
            this.L = l;
            this.R = r;
        }

        public int solution() {
            int min = R - L + 1;
            int pow = 1;
            while (pow <= R) {
                min = Math.min(min, zeroCount(L, R, pow));
                pow *= 2;
            }
            return min;
        }

        public int zeroCount(int l, int r,
                             int pow) {
            if (l / pow == r / pow) {
                if ((l & pow) == 0) {
                    return r - l + 1;
                }
                return 0;
            }
            int zc = 0;

            if (l % pow != 0) {
                if ((l & pow) == 0) {
                    zc += (pow) - l % pow;
                }
                l += (pow) - l % pow;
                return zc + zeroCount(l, r, pow);
            }
            if (r % pow != pow - 1) {
                if ((r & pow) == 0) {
                    zc += r % pow + 1;
                }
                r -= (r % pow) + 1;
                return zc + zeroCount(l, r, pow);
            }

            int len = r - l + 1;
            if ((len / pow) % 2 == 0) {
                return zc + len / 2;
            }
            if ((l & pow) > 0) {
                return zc + (len - pow) / 2;
            } else {
                return zc + (len + pow) / 2;
            }
        }
    }

    private static class FastScanner {
        BufferedReader br;
        StringTokenizer st;

        FastScanner(InputStream stream) {
            try {
                br = new BufferedReader(new InputStreamReader(stream));
            } catch (Exception e) {
                e.printStackTrace();
            }
        }

        String next() {
            while (st == null || !st.hasMoreTokens()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        int nextInt() {
            return Integer.parseInt(next());
        }

        int[] readIntArr(int n) {
            int[] result = new int[n];
            for (int i = 0; i < n; i++) {
                result[i] = Integer.parseInt(next());
            }
            return result;
        }

        long[] readLongArr(int n) {
            long[] result = new long[n];
            for (int i = 0; i < n; i++) {
                result[i] = Long.parseLong(next());
            }
            return result;
        }

        void close() {
            try {
                br.close();
            } catch (IOException e) {
                e.printStackTrace();
            }
        }

        long nextLong() {
            return Long.parseLong(next());
        }

    }

}
