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


def getKCount(k, gap):
    res = k / gap
    if not res.is_integer():
        res = int(res) + 1
    else:
        res = int(res)
    return res


for _ in range(Ntc):
    n, k = map(int, input().split(' '))
    gap_space = n - 1
    k_count = getKCount(k, gap_space) - 1
    previous_divisible = n * k_count
    current_k = gap_space * k_count
    distance_to_ans = k - current_k
    print(distance_to_ans + previous_divisible)
    # next_divisible = n * (k // gap_space)
    # distance_to_ans = k - (n * gap_space)
    # print(next_divisible + distance_to_ans)