You have a list of numbers from 1 to n written from left to right on the blackboard.

You perform an algorithm consisting of several steps (steps are 1-indexed). On the i-th step you wipe the i-th number (considering only remaining numbers). You wipe the whole number (not one digit).

<image>

When there are less than i numbers remaining, you stop your algorithm. 

Now you wonder: what is the value of the x-th remaining number after the algorithm is stopped?

Input

The first line contains one integer T (1 ≤ T ≤ 100) — the number of queries. The next T lines contain queries — one per line. All queries are independent.

Each line contains two space-separated integers n and x (1 ≤ x < n ≤ 10^{9}) — the length of the list and the position we wonder about. It's guaranteed that after the algorithm ends, the list will still contain at least x numbers.

Output

Print T integers (one per query) — the values of the x-th number after performing the algorithm for the corresponding queries.

Example

Input


3
3 1
4 2
69 6


Output


2
4
12
# x=input().split()
# fir=x[0]
# sec=x[1]
# thi=x[0]
# same=[]
# same=set(same)
# same.add(fir,sec,thi)
# if(len(same)==1):
# 	print(0)
# else:
# 	if(len(same)==2):
# 		print(1)
# 	else:
		
# 		tiles=[]
# 		tiles=set(tiles)	
# 		tiles.add(fir[1],sec[1],thi[1])
# 		if(len(tiles)==3):
# 			print(2)
# 		else:
# 			seq=[]
# 			con=0
# 			fir_n=int(fir[0])
# 			sec_n=int(sec[0])
# 			thi_n=int(thi[0])
# 			seq.append(fir_n,sec_n,thi_n)
# 			seq.sort()
# 			if(seq[2]-seq[1]==1 or seq[1]-seq[0]==1):
# 				if(seq[1]-seq[0]==1):
# 					con=3
# 				else:
# 					con=2
# 			else:
# 				con=0
							
# 			if(tiles==1):
# 				if(con==2):
# 					print(1)
# 				else:
					
						
				
				

# 			if(len(tiles)==1)	



for _ in range(int(input())):
	n,x=map(int,input().split())
	# A=[int(i+1) for i in range(n)]
	i=0
	print(2*x)
	# while(True):
	# 	if(i>=n):
	# 		print(2*x)
	# 		break
	# 	else:
	# 		n=n-1
	# 	i+=2		
