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.*;
import java.util.*;

public class CodeforcesKntDivisible
{
	private static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

	private static StringBuffer ans = new StringBuffer();

	private static void solution(int n, int k) {
		int skip = (int) Math.floor(k / (n - 1));
		// System.out.println("skip:" + skip);
		int move = (int) Math.floor(k % (n - 1));
		// System.out.println("move:" + move);
		int num = n * skip + move;
		if (move == 0) {
			num--;
		}
		ans.append(num + "\n");
	}

	public static void main(String[] args)throws IOException {
		try{
			final long startTime = System.currentTimeMillis();
			for (int test = Integer.parseInt(br.readLine()); test > 0; test--) {
				int[] arr = Arrays.stream(br.readLine().split(" ")).mapToInt(Integer::valueOf).toArray();
				// ans.append("test" + test + "\n");
				solution(arr[0], arr[1]);
			}
			System.out.print(ans);
			final long finishTime = System.currentTimeMillis();
// 			System.out.println("Time:" + (finishTime - startTime) + " ms");
		} catch (Exception e) {
			e.printStackTrace();
		}
	}
}