Bits

``` - $n$组询问，每次给出一个区间$l, r$，你需要输出在这个区间内二进制表示中1的个数最多的数 - 如有多个答案，输出最小的那个 - $(n \leq10^4, 0\leq l, r \leq10^{18})$ ``` ### 效果 - $n$组询问，每次给出一个区间$l, r$，你需要输出在这个区间内二进制表示中1的个数最多的数 - 如有多个答案，输出最小的那个 - $(n \leq10^4, 0\leq l, r \leq10^{18})$

Let's denote as  the number of bits set ('1' bits) in the binary representation of the non-negative integer $ x $ . You are given multiple queries consisting of pairs of integers $ l $ and $ r $ . For each query, find the $ x $ , such that $ l<=x<=r $ , and  is maximum possible. If there are multiple such numbers find the smallest of them.

Let's denote as  the number of bits set ('1' bits) in the binary representation of the non-negative integer $ x $ . You are given multiple queries consisting of pairs of integers $ l $ and $ r $ . For each query, find the $ x $ , such that $ l<=x<=r $ , and  is maximum possible. If there are multiple such numbers find the smallest of them.

For each query print the answer in a separate line.

3
1 2
2 4
1 10

1
3
7

Let's denote as  the number of bits set ('1' bits) in the binary representation of the non-negative integer $ x $ . You are given multiple queries consisting of pairs of integers $ l $ and $ r $ . For each query, find the $ x $ , such that $ l<=x<=r $ , and  is maximum possible. If there are multiple such numbers find the smallest of them.