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:
#lannisters don't act like fools

'''And who are you, the proud lord said,
That I must bow so low?
Only a cat of a different coat,
That's all the truth I know.
In a coat of gold or a coat of red,
A lion still has claws,
And mine are long and sharp, my lord,
As long and sharp as yours.
And so he spoke, and so he spoke,
That lord of Castamere,
But now the rains weep o'er his hall,
With no one there to hear.
Yes now the rains weep o'er his hall,
And not a soul to hear.
'''


import math
t=int(input())
for _ in range(0,t):
    str1=input()
    str1=str1.split()
    n=int(str1[0])
    k=int(str1[1])
    if k%(n-1)==0:
        ans=k+(k//(n-1)-1)
    else:
        ans=k+(k//(n-1))
    print(ans)