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:
# int(input())
# [int(s) for s in input().split()]
# input()
from math import ceil


def solve():
    t = int(input())

    for i in range(t):
        n, k = [int(s) for s in input().split()]
        if k >= n:
            k2 = k
            while True:
                s = k2 // n
                if k2 - s >= k:
                    # bin search
                    l = k
                    r = k2
                    while l+1 < r:
                        mid = (l+r)//2
                        s = mid//n
                        if mid-s >= k:
                            r = mid
                        else:
                            l = mid
                    if r % n == 0:
                        print(r-1)
                    else:
                        print(r)
                    break
                else:
                    k2 += s
        else:
            print(k)


if __name__ == "__main__":
    solve()