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 PYTHON):

Solution:
def checkNotDivisible(n, k, min_val, max_val, result):
    if(min_val> max_val):
        print (result)
    else:
        piv = (min_val + max_val) // 2
        not_div = piv - (piv // n)
        if (not_div > k):
            checkNotDivisible(n, k, min_val, piv-1, result)
        elif (not_div < k):
            checkNotDivisible(n, k, piv+1, max_val, result)
        else:
            checkNotDivisible(n, k, min_val, piv-1, piv)
        



tests = int(raw_input())

count_tests = 0

while(count_tests != tests):
    entrada = [int(a) for a in raw_input().split()]
    checkNotDivisible(entrada[0], entrada[1], 0, 2*entrada[1],0)
    count_tests += 1