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

Solution:
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.*;

public class C
{
   public static void main(String[] argv) throws Exception 
   {
      BufferedReader infile = new BufferedReader(new InputStreamReader(System.in));
      int x = Integer.parseInt(infile.readLine());
      int[] n = new int[x];
      int[] k = new int[x];
      for(int a = 0; a < x; a++)
      {
         StringTokenizer st = new StringTokenizer(infile.readLine());
         n[a] = Integer.parseInt(st.nextToken());
         k[a] = Integer.parseInt(st.nextToken()); 
      }
      for(int a = 0; a < x; a++)
      {
         int group = k[a]/(n[a]-1);
         int r = k[a]%(n[a] - 1);
         if(r == 0)
            r = -1;
         int out = group*n[a] + r;
         System.out.println(out);
      }
   }
}