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:
# cook your dish here
MOD =  1000000007
#import time
#import heapq
#import math
#import string
#import bisect


def solve(n,k):
    if n==2:
        ans = 2*k-1
    else:
        if k%(n-1)==0:
            ans = n*(k//(n-1))-1
        else:
            ans = n*(k//(n-1)) + k%(n-1)
    print(ans)
     
            
for i in range(int(input())):
    #x,y,l,r= map(int,input().split())
    n,k= map(int,input().split())
    #n = int(input())
    #a = list(map(int,input().split()))
    #b = list(map(int,input().split()))
    #l,r= map(int,input().split())
    #n = int(input())
    #s = input()
    #sa = list(map(str,input().split()))
    #b = list(map(int,input().split()))
    #st = time.process_time()
    solve(n,k)
    #print(s)
    #pt = solve(s)
    #print(pt)
    #print("yes" if pt==1 else "no")
    #print("Linear : ",time.process_time() - st)