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:
from sys import stdin
def main():
    #入力
    readline=stdin.readline
    t=int(readline())
    res=[]
    for i in range(t):
        n,k=map(int,readline().split())
        l=0
        r=3*10**9
        cnt=0
        while True:
            x=(l+r)//2
            if x%n==0:
                x+=1
            y=x//n
            if x-y<k:
                l=x
            elif x-y>k:
                r=x
            elif x-y==k:
                res.append(x)
                break
    for i in range(t):
        print(res[i])
if __name__=="__main__":
    main()