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 brute(n, k):
    seen = 0
    x = 0
    while True:
        x += 1
        if x % n != 0:
            seen += 1
        if seen == k:
            return x

def soln(n, k):
    c = k // (n - 1)
    ans = k + c
    if k % (n - 1) == 0:
        ans -= 1
    return ans

def main():
    t = int(input())
    for _ in range(t):
        n, k = [int(x) for x in input().split(' ')]
        result = soln(n, k)
        # result = brute(n, k)
        print(result)

# import random
# def randomTest():
#     t = 100
#     for i in range(1, t + 1):
#         n = random.randint(2, 100)
#         k = random.randint(1, 20)
#         print(f'Case #{i}: {(n, k) = }')
#         b = brute(n, k)
#         f = soln(n, k)
#         try:
#             assert(b == f)
#         except:
#             print(f'{(b, f) = }')
#             break


if __name__ == "__main__":
    main()
    # randomTest()