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 = (input())
t = int(t)
shetchikshetchikov = 0
while shetchikshetchikov < t  :
    n,k = input().split()
    n = int(n)
    k = int(k)
    shetchik123 = k
    if n == k :
            c = n + 1
            print(c)
    else :
        if n == 2 :
            c = (n * k) - 1
            print(c)
        else :
            sps = k
            spnov = k
            gg = 0
            desps = sps // n
            k1 = k
            while gg < 32:
                spnov = sps + desps
                desps = spnov // n
                gg = gg + 1
            print(spnov)
    shetchikshetchikov = shetchikshetchikov + 1
        
        
        
'''7 // 3 = 2
7 + 2 = 9
9 // 3 = 3
7 + 3 = 10
10 // 3 = 3
7 + 3 = 10

sps // n = desps
sps + desps = spnov
spnov // n = desps
sps + desps = spnov

10 // 2 = 5
10 + 5 = 15
15 // 2 = 7
10 + 7 = 17
17 // 2 = 8
10 + 8 = 18
18 // 2 = 9
10 + 9 = 19
19 // 2 = 9
10 + 9 = 19

sps // n = desps
sps + desps = spnov
spnov // n = desps
sps + desps = spnov
spnov // n = desps
sps + desps = spnov
spnov // n = desps
sps + desps = spnov
spnov // n = desps
sps + desps = spnov'''