And It's Non-Zero

 You are given an array consisting of all integers from 

[l,r]$[l,r]$ inclusive. For example, if l=2$l=2$ and r=5$r=5$, the array would be [2,3,4,5]$[2,3,4,5]$. What's the minimum number of elements you can delete to make the bitwise 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$t$ (1≤t≤104$1\le t\le {10}^4$) — the number of test cases. Then t$t$ cases follow.

The first line of each test case contains two integers l$l$ and r$r$ (1≤l≤r≤2⋅105$1\le l\le r\le 2\cdot {10}^5$) — the description of the array.

Output

For each test case, output a single integer — the answer to the problem.

Example

input

Copy

5
1 2
2 8
4 5
1 5
100000 200000

output

Copy

1
3
0
2
31072

• Tweet
• Share
• Share
• Share
• Share

Related Post