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())
for _ in range(0,T):
    n=int(input())
    a,b=map(int,input().split())
    s=input()
    s=[int(x) for x in input().split()]
    for i in range(0,len(s)):
        a,b=map(int,input().split())"""


T=int(input())
for _ in range(0,T):
    n,k=map(int,input().split())
    tt=k//(n-1)
    if(k%(n-1)!=0):
        tt+=1
    tt2=tt-1
    tot=(tt2*(n-1))
    req=k-tot
    ans=(tt2*n)+req
    print(ans)
    """if(n%2!=0 and k%2==0):
        print('NO')
    else:
        if(n%2!=0 and k%2!=0):
            L=[]
            for i in range(k-1):
                L.append(1)
            if(n-k+1>0):
                L.append(n-k+1)
                print('YES')
                print(*L)
            else:
                print('NO')
        elif(n%2==0 and k%2==0):
            L=[]
            for i in range(k-1):
                L.append(1)
            if(n-k+1>0):
                L.append(n-k+1)
                print('YES')
                print(*L)
            else:
                print('NO')
        elif(n%2==0 and k%2!=0):
            L=[]
            for i in range(k-1):
                L.append(2)
                n-=2
            if(n>0):
                L.append(n)
                print('YES')
                print(*L)
            else:
                print('NO')"""