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:
def isodd(a):
    if (int(a) % 2 == 0):
        return False
    else:
        return True
def iseven(b):
    if (int(b) % 2 == 0):
        return True
    else:
        return False


t=input()
solve_list=[]
for i in range(int(t)):
    n,k=input().split(" ")
    x = int(int(k) - int(int(n) - 1))
    y = int(int(n) - 1)
    if int(k)<int(n):
        solve_list.append(k)
    elif int(k)==int(n):
        solve_list.append(str(int(int(n)+1)))
    elif int(x)%int(y)==0:
        z = int(((int(x) / int(y)) + int(x) + int(n))-1)
        solve_list.append(z)
    else:
        z = int(((int(x) / int(y)) + int(x) + int(n)))
        solve_list.append(z)
for i in range(len(solve_list)):
    print(solve_list[i])