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:
cases = int(input())


for i in range(cases):
    cadena=input().split()
    n = int(cadena[0])
    k = int(cadena[1])    
    if (k==n):
        print(k+1)    
    elif(k==1):
        print(1)
    elif(n==2 and k%n==0):
        r = k*2-1
        print(r)
    elif (k<n):
        print(k)
    else: 
        cociente = int(k/n)
        cociente1=0
        while(cociente1<k):
            suma = k + cociente    
            cociente = int((suma)/n)
            cociente1 = int (suma - cociente)    
        print(suma)