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:
def solve(m, n, s):
      if m % n == 0:
          # print('Case 0')
          return solve(m + 1, n, s)
      # print(f'Calculating {m} {n} {s}')
      if s < n - m % n:
          # print('Case 1')
          return m + s
      if m % n != 1:
          # print('Case 2')
          return solve(m + n - m % n + 1, n, s - n + m % n)
      # print('Case 3')
      return solve(m + s, n, s // n)
     
     
def main():
    t = int(input())
    for i in range(t):
        n, k = [int(number) for number in input().split()]
        print(solve(1, n, k - 1))
        
if __name__ == "__main__":
    main()