Problem: You are given two positive integers n and k. Print the k-th positive integer that is not divisible by n.

For example, if n=3, and k=7, then all numbers that are not divisible by 3 are: 1, 2, 4, 5, 7, 8, 10, 11, 13 .... The 7-th number among them is 10.

Input

The first line contains an integer t (1 ≤ t ≤ 1000) — the number of test cases in the input. Next, t test cases are given, one per line.

Each test case is two positive integers n (2 ≤ n ≤ 10^9) and k (1 ≤ k ≤ 10^9).

Output

For each test case print the k-th positive integer that is not divisible by n.

Example

Input


6
3 7
4 12
2 1000000000
7 97
1000000000 1000000000
2 1


Output


10
15
1999999999
113
1000000001
1

Solution (in PYTHON3):

Solution:
#kth divisible by n

INPUT=True


def func(ip_ls):
	n=ip_ls[0]
	k=ip_ls[1]
	
	if k == 1:
		return(1)
	
	#construct matrix
	#get row
	if k%(n-1)== 0:
		row = int(k/(n-1))
		index=n-1
	else:
		row = int(k/(n-1))+1
		index=k%(n-1)
	
	#generate that row
	value=(row*n)-(n-index)
	return(value)
	


op_ls=[]
while INPUT:
	t=input()
	if int(t) <= 10**3 and int(t) >=1:
		for i in range(int(t)):
			ip_ls=[]
			ip=input()
			#print(ip)
			ip_ls=ip.split()
			ip_ls=list(map(int,ip_ls))
			if ip_ls[0] <= 10**9 and ip_ls[0] >= 2 and ip_ls[1] <= 10**9 and ip_ls[1] >= 1:
				op_ls.append(func(ip_ls))
		
	INPUT=False

for i in op_ls:
	print(i)