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 Div2.B;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class AndItsNonZero {
    private static int LIM=200000;
    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        int [][]cnt=new int[LIM+1][32];
        for (int i = 1; i <= LIM; i++) {
            for (int j = 0; j < 32; j++) {
                cnt[i][j]=cnt[i-1][j];
                if (((1 << j) & i) == 0){
                    cnt[i][j]+=1;
                }
            }
        }
        int t = Integer.parseInt(br.readLine());
        while (t > 0) {
            String[] lr = br.readLine().split(" ");
            int l = Integer.parseInt(lr[0]);
            int r = Integer.parseInt(lr[1]);
            int nb = getNoOfBits(r);

            int ans = -1;
            for (int i = 0; i < nb; i++) {
                if (ans == -1 || ans > cnt[r][i]-cnt[l-1][i])
                    ans = cnt[r][i]-cnt[l-1][i];
            }
            System.out.println(ans);
            t--;
        }
    }

    private static int getNoOfBits(int x) {
        int cnt = 0;
        while (x > 0) {
            cnt = cnt + 1;
            x /= 2;
        }
        return cnt;
    }
}
