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
t=int(raw_input())
while t>0:
	a,b=map(long,raw_input().split())
	if b-a==1:
		print a&b
	elif b!=0 and (b&(b-1)==0):
		print b-2
	else:
		if b%2!=0:
			print b-1
		else:
			print b-2
	t=t-1