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:
import math
n=int(input())
q=[]
for i in range(n):
	q.append(input())

for i in q:
	ss=i.split(" ")
	n=int(ss[0])
	k=int(ss[1])
	z=math.ceil(k/(n-1))
	# print(z)
	y=(z-1)*(n)
	done=y-(math.floor(y/n))
	# print(y)
	left=k-done
	print(y+left)

	# rem=k%n
	# # if k<n:
	# # 	rem=0
	# mark=(math.floor(k/n))*n
	# # print(mark)
	# # if rem==0:
	# # 	mark=mark-1
	# done=(math.floor(k/n))*(n-1)
	# # print(done)
	# left=k-done
	# # print(left)
	# a=math.floor(left/(n-1))
	# # print(a)
	# # if (left/(n-1))!=1:
	# # if left!=(n-1):
	# mark=mark+(n)*a
	# if left==n-1:
	# 	mark=mark-1
	
	# x=left%(n-1)
	# mark=mark+x
	# print(mark)