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 PYTHON):

Solution:
FAST_IO = 0
if FAST_IO:
    import io, sys, atexit
    rr = iter(sys.stdin.read().splitlines()).next
    sys.stdout = _OUTPUT_BUFFER = io.BytesIO()
    @atexit.register
    def write():
        sys.__stdout__.write(_OUTPUT_BUFFER.getvalue())
else:
    rr = raw_input
rri = lambda: int(rr())
rrm = lambda: map(int, rr().split())

####

from collections import defaultdict as ddic, Counter, deque
from itertools import product, combinations, permutations
import heapq
YES, NO, IMP = "YES", "NO", "IMPOSSIBLE"
MOD = 10**9 + 7

####

def solve(N,  K):
    #Kth not divisible by N
    floor = 0
    K -= 1
    for bit in range(30, -1, -1):
        e = 1 << bit
        take = (N - 1) * e
        if K >= take:
            K -= take
            floor += e * N
    return floor + K + 1

T = rri()
for _ in xrange(T):
    N, K = rrm()
    ans = solve(N, K)
    print ans