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:
for i in range(int(input())):
    n,k=map(int,input().split())
    if n==k:
        print(n+1)
    elif k<n:
        print(k)
    else:
        if n<100000:
            l=[]
            for j in range(1,n):
                l.append(j)
            a=len(l)
            if a>=k:
                print(l[k-1])
    
            else:
                b=k%a
                e=k-a
                if e%a!=0:
                    c=(e//a)+1
                else:
                    c=e//a
                d=l[b-1]+n*c
                print(d)
        else:
            a=k//n
            p=0
            y=k+a
            for j in range (k,y+1):
                if j%n==0:
                    p=p+1
            print(y+p)