Given two numbers A and B. Find the value of pair (P,Q) such that A ≤ P < Q ≤ B value of P AND Q is maximum where AND is a binary operator. Refer to this link for more information about AND operator : http://en.wikipedia.org/wiki/Bitwise_operation#AND 

Input:
First line of input contains number of test cases T. Each test case contains two numbers A and B.  

Output: 
For each test case print the value of maximum AND.  

*Constraints: * 
1 ≤ T ≤ 1000
1 ≤ A < B ≤10^18

SAMPLE INPUT
2
2 3
4 8
SAMPLE OUTPUT
2
6
def max_and2():
    T = int(raw_input())

    for i in range(T):
        tc_dict = dict()
        A, B=[int(x) for x in raw_input().split(' ')]
        and_results = set()
        if B-A == 1:
            print A & B
            continue
        and_results.add(A & B)
        and_results.add(B-1 & B)
        and_results.add(B-2 & B-1)
        print max(and_results)
    return
max_and2()