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 collections
import sys
infile = sys.stdin.buffer
def gs()  : return infile.readline().rstrip()
def gi()  : return int(gs())
def gss() : return gs().split()
def gis() : return [int(x) for x in gss()]
MOD = 998244353 
'''
001
010
011
100
101
'''
8, 9, 10, 11, 12, 13, 14
def setBitNumber(n):
    if (n == 0):
        return 0
 
    msb = 0
    n = n // 2
 
    while (n > 0):
        n = n // 2
        msb += 1
    return (1 << msb)

def f(l,r):
    ans = 0 
    n = r - l + 1
    q = r - max(l,setBitNumber(r)) + 1
    ans = max(q, r-l+1 - q)
    
    r = setBitNumber(r)
    r -= 1
    q = r - max(l,setBitNumber(r)) + 1
    ans = max(q, n - q)
    return n - ans
def main(infn="") :
    global infile
    infile = open(infn,"r") if infn else open(sys.argv[1],"r") if len(sys.argv) > 1 else sys.stdin
    ######################################################################
        
    cs = gi()
    
    for case in range(1, cs+1):
        l,r = gis()
        print (f(l,r))
    ######################################################################    
if __name__ == '__main__' : main()