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.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.math.BigDecimal;
import java.math.BigInteger;
import java.util.Iterator;
import java.util.Scanner;
import java.util.StringTokenizer;

public class Main
{

	public static InputReader sc=new InputReader(System.in);
	public static void main(String[] args) throws IOException
	{
		int t=sc.nextInt();
		while(t-->0)
		{
			int n=sc.nextInt();
			int k=sc.nextInt();
			System.out.println(k+(k-1)/(n-1));
		}
	}

	public static class InputReader
	{
		private BufferedReader in;
		private StringTokenizer Tokenizer;

		public InputReader(InputStream stream)
		{
			in = new BufferedReader(new InputStreamReader(stream), 32768);
			Tokenizer = null;
		}

		public String next() throws IOException
		{
			while (Tokenizer == null || !Tokenizer.hasMoreTokens())
			{
				Tokenizer = new StringTokenizer(in.readLine());
			}
			return Tokenizer.nextToken();
		}

		public int nextInt() throws IOException
		{
			return Integer.valueOf(next());
		}

		public String nextLine() throws IOException
		{
			while (Tokenizer == null || !Tokenizer.hasMoreTokens())
			{
				Tokenizer = new StringTokenizer(in.readLine(), "\n");
				if (!Tokenizer.hasMoreTokens())
					return "\n";
			}
			return Tokenizer.nextToken();
		}

		public BigInteger nextBigInteger() throws IOException
		{
			return new BigInteger(next());
		}

		public BigDecimal nextBigDecimal() throws IOException
		{
			return new BigDecimal(next());
		}

		public double nextDouble() throws IOException
		{
			return Double.valueOf(next());
		}

		boolean hasNext()
		{
			while (Tokenizer == null || !Tokenizer.hasMoreTokens())
			{
				try
				{
					Tokenizer = new StringTokenizer(in.readLine());
				} catch (Exception e)
				{
					return false;
					// TODO: handle exception
				}
			}
			return true;
		}
	}
}