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:
t = int(input())
saida = []
for i in range(t):
    entrada = input().split()
    n = int(entrada[0])
    k = int(entrada[1])
    s = 0

    if k < n:
        s = k
    elif k == n:
        s = k+1
    else:
        l = 0
        r = k*2
        while l < r:
            m = int((l+r)/2)
            if m == l or m == r:
                break
            if int(m/n) > m-k:
                l = m
            elif int(m/n) < m-k:
                r = m
            else:
                s = m
                r = m
    saida.append(s)

for h in saida:
    print (h)