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:

import sys



def solve(n, k):
#    num_div =  int(k // (n - 1))
#    y = int(((k // (n - 1)) * (n - 1)) // k)
#    if (k % (n - 1)) == 0:
#        num_div -= 1
#    print(k + num_div)
    print(k + int(k // (n - 1)) - int(((k // (n - 1)) * (n - 1)) // k))

def main():

  n_cases = None
  for line in sys.stdin:
      if not n_cases:
          n_cases = line
          continue
      line = line.strip()
      line = line.rstrip()
      line = line.split(" ")
      n = int(line[0])
      k = int(line[1])
      solve(n , k)

main()