Let's denote as $\text{[math]}$ 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 $\text{[math]}$ is maximum possible. If there are multiple such numbers find the smallest of them.

Input

The first line contains integer n — the number of queries (1 ≤ n ≤ 10000).

Each of the following n lines contain two integers l_i, r_i — the arguments for the corresponding query (0 ≤ l_i ≤ r_i ≤ 10¹⁸).

Output

For each query print the answer in a separate line.

Note

The binary representations of numbers from 1 to 10 are listed below:

1₁₀ = 1₂

2₁₀ = 10₂

3₁₀ = 11₂

4₁₀ = 100₂

5₁₀ = 101₂

6₁₀ = 110₂

7₁₀ = 111₂

8₁₀ = 1000₂

9₁₀ = 1001₂

10₁₀ = 1010₂

Bits

Examples