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 numpy as np
# # a = np.array([[1,2,3],[4,5,6]])
# # print(a.ndim)
# # f = open("hello.txt","w")
# # f.write("Hello Darkness my old friend!")
# # f.close()

# # f = open("hello.txt","a")
# # f.write("\nHello Darkness my old friend!")
# # f.close()

# # f = open("hello.txt","r")
# # for x in f:
# # 	print(x)

# # import os
# # os.remove("hello.txt")
# # k = int(input())

# # if not type(k) is int:
# # 	raise TypeError("Integer daalna hai :|")
# # else:
# # 	print("Correct :)")

# # try:
# # 	k = int(input())
# # except ValueError:
# # 	raise TypeError("Integer Daalna")
# # else:
# # 	print("Correct")
# x = "hello"

# if not type(x) is int:
#   raise TypeError("Only integers are allowed")
# import math
# for _ in range(int(input())):
# 	n = int(input())
# 	k = n
# 	l =[]
# 	for i in range(math.floor(math.log(k, 10)+1)):
# 		r = n%10
# 		if(r!=0):
# 			l += [(r*pow(10,i))]
# 		n = n//10
# 	print(len(l))
# 	for x in l:
# 		print(x,end=" ")
def z(n,k):
	if(k<n):
		return(k)
	else:
		s = k//n
		if((k + s)//n == s):
			return(k + s)
		else:
			m = s*n
			k = k - s*n + s
			return(m + z(n,k))

for _ in range(int(input())):
	n,k = map(int,input().split())
	print(z(n,k))