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:
// Working program with FastReader
import java.io.*;
import java.util.*;

public class codeforces_1352C
{
	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;
		}
	}

	static void solve(FastReader ob){
        long n=ob.nextLong(),k=ob.nextLong();
        long count =0,check=1;
        if(k<n){
            System.out.println(k);
            return;

        }
        long c1=(k/(n-1));
        //System.out.println(c1+" c1");
        long ans;
        if(k%(n-1)!=0){
            ans=(c1*n) + k%(n-1);

        }
        else{
            ans=(c1*n)-1;
        }
        System.out.println(ans);


    }
	public static void main(String[] args)
	{
		FastReader ob=new FastReader();
		int t =ob.nextInt();
        for (int i = 0; i <t ; i++) {
            solve(ob);

        }

	}
}