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.util.*;
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.math.BigInteger;
import java.util.Scanner;
import java.util.StringTokenizer;
import java.util.TreeMap;
 
public class temp {
	
	void solve() throws IOException
	{
		FastReader sc=new FastReader();
		int t = sc.nextInt();
		while(t-->0)
		{
			long n = sc.nextLong();
			long k = sc.nextLong();
			
			long l = 0 , r = (long)1e9 , ans = 0 , kleft = 0;
			while(l<=r)
			{
				long mid = (l+r)/2;
				long tot = mid*n - mid;
				if(tot==k)
				{
					ans = mid*n - 1;
					kleft = 0;
					break;
				}
				if(tot < k)
				{
					ans = mid*n;
					kleft = k - tot;
					l = mid+1;
				}
				else
					r = mid-1;
			}
			//System.out.println(ans+" "+kleft);
			System.out.println(ans+(kleft%n));
		}
	}
	
	public static void main(String[] args) throws IOException {
		// TODO Auto-generated method stub
		new temp().solve();
 
	}
	
	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;
        }
    }
 
}