Codeforces 484A. Bits 贪心

A. Bits

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

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.

Input

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

Each of the following n lines contain two integers li, ri — the arguments for the corresponding query (0 ≤ li ≤ ri ≤ 1018).

Output

For each query print the answer in a separate line.

Sample test(s)

input

3
1 2
2 4
1 10

output

1
3
7

Note

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

110 = 12

210 = 102

310 = 112

410 = 1002

510 = 1012

610 = 1102

710 = 1112

810 = 10002

910 = 10012

1010 = 10102

/**
 * Created by ckboss on 14-11-7.
 */
import java.util.*;

public class CF484A
{
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int T_T = in.nextInt();
        while (T_T-- > 0) {

            long l = in.nextLong(), r = in.nextLong();

            long low=0;
            while(true) {

                int mid = -1;
                long low_leve=-1;
                for (int i = 0; i <= 60; i++) {
                    long temp=(1L << i) - 1L;
                    if(temp>r) break;
                    if ( temp >= l && temp <= r) {
                        mid = i;
                    }
                    if(temp < l){
                        low_leve=temp;
                    }
                }

                if (mid != -1) {
                    System.out.println((1L << mid) - 1L+low);
                    break;
                }
                else{
                    low_leve++;
                    low+=low_leve;
                    l-=low_leve; r-=low_leve;
                }
            }
        }
    }
}