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:
# Importing Modules
from collections import *
from itertools import *
from functools import *
import sys
import os
import time
# ~ import numpy as np


# Debugging and Timer Flags
timer = False
debug = False

# ---------- Helper Functions -----------
def timeit(method):
    def wrapper(*args, **kwargs):
        mname = method.__name__
        if debug:
            print("{}(args:{}, kwargs:{})".format(mname, args,kwargs))
        if timer:
            ts = time.time()
        result = method(*args, **kwargs)
        if timer:
            te = time.time()
            print('%r  %2.2f ms'% (mname, (te-ts) * 1000))
        return result
    return wrapper

def read_ints():
    return list(map(int,input().split()))

def read_floats():
    return list(map(float,input().split()))

def read_strs():
    return input().split()
# ----------------------------------------




@timeit
def main():
    t = int(input())
    for _ in range(t):
        n,k = read_ints()
        m = n-1
        ans = (k//m)*n+(k%m)
        if k%m==0:
            print(ans-1)
        else:
            print(ans)


if __name__=="__main__":
    main()