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

public class HelloWorld{

    public static int[][] preprocess() {
        int[][] arr = new int[200001][20];
        int j = 0, rem, temp;
        for(int i = 1; i < 200001; i++) {
            temp = i;
            j = 0;
            while(j < 20) {
                rem = 0;
                if(temp > 0) {
                    rem = temp % 2;
                    temp = temp / 2;
                }
                
                arr[i][j] = rem;
                
                j++;
            }
        }
        
        for(int i = 2; i < 200001; i++) {
            for(j = 0; j < 20; j++) {
                arr[i][j] += arr[i - 1][j]; 
            }
        }
        
        // for(int i = 2; i < 9; i++) {
        //     for(j = 0; j < 20; j++) {
        //         System.out.printf(arr[i][j] + " ");
        //     }
            
        //     System.out.println();
        // }
        
        return arr;
    }

    public static void main(String []args){
        Scanner s  = new Scanner(System.in);
        
        int max = -1;
        int[][] arr = new int[200001][20];
        arr = preprocess();
        
        int t = s.nextInt();
        
        while(t  > 0) {
            max = -1;
            int l = s.nextInt();
            int r = s.nextInt();
            
            // for(int i = 0; i < 20; i++) {
            //     System.out.printf(arr[l - 1][i] + " ");
            // }
            
            // System.out.println();
            
            // for(int i = 0; i < 20; i++) {
            //     System.out.printf(arr[r][i] + " ");
            // }
            
            // System.out.println();
            
            for(int i = 0; i < 20; i++) {
                //System.out.println();
                int diff = arr[r][i]  - arr[l - 1][i];
                
                if(diff > max) {
                  max = diff; 
                }
            }
            
            System.out.println((r - l + 1) - max);
            
            t--;
        }
    }
}