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:
from math import ceil
from math import floor	
from math import sqrt
from math import log

def mod_expo(n, p, m):
	"""find (n^p)%m"""
	result = 1
	while p != 0:
		if p%2 == 1:
			result = (result * n)%m
		p //= 2
		n = (n * n)%m
	return result
	
def find_undev(n, k):
	if k%(n-1) == 0:
		return int((n*k)/(n-1) - 1)
	return floor((n*k)/(n-1))

t=1
t=int(input())
while t:
	t = t - 1
	count=0
	# n, ox, oy = map(int, input().split())
	n, k = map(int, input().split())
	# text = input()
	# n = int(input())
	# above = list(map(int, input().strip().split()))[:n]
	# above = input()
	# below = input()
	arr = []
	b = []
	
	#a1, b1 = map(int, input().split())
	#a2, b2 = map(int, input().split())
	
	# print(a + g)
	
	# print(ffin(n, arr, b))
	#if is_square(a1, b1, a2, b2):
	# 	print("YES")
	#else:
	#	print("NO")
	#answers = find_given_gcd(n, k)
	print(find_undev(n, k))
	#print(contest_function(n, arr))