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:

//package c2;
import java.io.*;
import java.util.*;

public final class C2 {
     public static void main(String args[]) throws Exception{
    BufferedWriter out = new BufferedWriter(new OutputStreamWriter(new FileOutputStream(java.io.FileDescriptor.out), "ASCII"), 512);        
      FastReader sc=new FastReader();     
        int tc=sc.nextInt();
        long n,k,l,r,mid,ans;
      while(tc-->0)
      {
         n=sc.nextLong();
         k=sc.nextLong();
         l=1;r=2*n*k;
         ans=go(l,r,n,k);
         //System.out.println("ansi is "+ans+" "+(ans-ans/n));
         if(k==1)out.write("1\n");
         else if(ans-ans/n==k)out.write(ans%n==0?(ans-1)+"\n":ans+"\n");
         else if((ans-1)-(ans-1)/n==k)out.write((ans-1)%n==0?(ans-2)+"\n":(ans-1)+"\n");
         else out.write((ans+1)%n==0?(ans)+"\n":(ans+1)+"\n");
      out.flush();
      
    }
      
     }
       public static long go(long l,long r,long n,long k)
      {
          if(l>r)return l;
          long mid=(l+r)/2;
       //   System.out.println("l r mid "+l+"  "+r+" mid "+mid+" "+(mid-mid/3)+" k is "+k);
          if(mid-mid/n==k)return mid;
          else if((mid-(mid/n))<k)return go(mid+1,r,n,k);
          else return go(l,mid-1,n,k);
      }
     
 //////////////////////////////////////////////////////////////////////////////////
 ///////////////////////////////////////////////////////////////////////////////////////    
    
  static class FastReader
  {        

        BufferedReader br;        
        StringTokenizer st;        
       
        public FastReader() {            
            br = new BufferedReader(new InputStreamReader(System.in));            
        }        
        
        String next() {            
            while (st == null || !st.hasMoreElements()) {                
                try {                    
                    st = new StringTokenizer(br.readLine());                    
                } catch (IOException e) {                    
                    e.printStackTrace();                    
                }                
            }            
            return st.nextToken();            
        }        
        
        int nextInt() {            
            return Integer.parseInt(next());            
        }        
        
        long nextLong() {            
            return Long.parseLong(next());            
        }        
        
        double nextDouble() {            
            return Double.parseDouble(next());            
        }        
        
        String nextLine() {            
            String str = "";            
            try {                
                str = br.readLine();                
            } catch (IOException e) {                
                e.printStackTrace();                
            }            
            return str;            
        }        
    }

     
}