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
tc = int(raw_input())

while(tc > 0):
    s = raw_input()
    s = s.split()
    l = [int(c) for c in s]
    num = l[1]
    ans = 0
    d = l[1] - l[0]
    if d > 10:
        for i in range(0,10):
            tmp = (num-i) & (num-i-1)
            if tmp > ans:
                ans = tmp
    else:
        for i in range(0,d):
            tmp = (num-i) & (num-i-1)
            if tmp > ans:
                ans = tmp

    print (ans)
    tc-=1