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

def bf(n, k):
    cnt = 0
    for i in range(1,10**10):
        if i % n != 0:
            cnt += 1

        if cnt == k:
            return i


for _ in range(t):

    n, k = list(map(int,  input().split()))


    low = 0
    high = 10**10
    while low < high:
        mid = low + (high - low) // 2
        target = mid - mid // n

        # print(low,high,mid)
        if target == k:
            if mid % n == 0:
                if (mid-1) - (mid-1) // n == k:
                    print(mid-1)
                else:
                    print(mid+1)
            else:
                print(mid)
            break
        elif target > k:
            high = mid
        else:
            low = mid


    # print(bf(n,k))