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.*;
public class CF9{
    public static void main(String arg[])throws IOException{
        //Scanner sc=new Scanner(System.in);
        InputStreamReader isr=new InputStreamReader(System.in);
        BufferedReader br=new BufferedReader(isr);
       PrintWriter pw=new PrintWriter(System.out);
        
        long n=0;
        int t=0;
        long k=0;
        int i=0;
        String line="";
        String s[];
        //if(sc.hasNextInt())
            //t=sc.nextInt();
        t=Integer.parseInt(br.readLine());
        
        
        for(i=0;i<=t-1;i++){
            //if(sc.hasNextLong())
              //  n=sc.nextLong();
            //if(sc.hasNextLong())
              //  k=sc.nextLong();
              line=br.readLine();
              s=line.trim().split("\\s+");
              n=Long.parseLong(s[0]);
              k=Long.parseLong(s[1]);
              
              
            pw.println(getAns(n,k));
        }
        pw.close();
 
    }
    private static long getAns(long n,long k) {
 
        long m=k/(n-1)+k-1;
        if(k%(n-1)!=0)
            m++;
        return m;
 
    }
}