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 r(t=int):
    return list(map(t, input().split()))


def ri(t=int):
    return t(input())


def cd(it):
    ret_val = dict()
    for v in it:
        ret_val[v] = ret_val.get(v, 0) + 1
    return ret_val


for _ in range(ri()):
    n, k = r()

    if k % (n - 1):
        g = (k // (n - 1)) * n + k % (n - 1)
    else:
        g = (k // (n - 1)) * n - 1
    print(g)



    # n, k = r()
    #
    # if n == k:
    #     print('YES')
    #     for _ in range(k):
    #         print(1, end=' ')
    #     print()
    # elif n % 2:
    #     if k % 2 and k <= n:
    #         print('YES')
    #         for _ in range(k - 1):
    #             print(1, end=' ')
    #         print(n - k + 1)
    #     else:
    #         print('NO')
    # else:
    #     if k*2 <= n:
    #         print('YES')
    #         for _ in range(k - 1):
    #             print(2, end=' ')
    #         print(n - (k - 1) * 2)
    #     else:
    #         print('NO')