human
PYTHON3 solution for "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.":
assistant
#Here's the minimum number of elements you can delete to make the [bitwise AND](https://en.
 def h(n, k):
    return max(0, n - (1 << k) + 1)

def g(l,r,k):
    res_l = l & ((1 << (k+1)) - 1)
    res_r = r & ((1 << (k+1)) - 1)
    q_l = l >> (k+1)
    q_r = r >> (k+1)
    val = (q_r - q_l) * (1 << k)
    val += h(res_r,k)
    val -= h(res_l,k)
    if (l & (1 << k)):
        val += 1
    return val

def f(l,r):
    score = 0
    for k in range(20):
        score = max(score, g(l,r,k))
    return (r-l+1) - score

t = int(input())
for i in range(t):
    l,r = map(int, input().split())
    print(f(l,r))