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 Math.Codeforces;

import java.util.Scanner;
/**
 * @author Syed Ali.
 * @createdAt 01/04/2021, Thursday, 03:05
 */
public class KthNotDivisibleByN {
	static Scanner scanner = new Scanner(System.in);

	static long MAX = (long)Math.pow(10,9);

	static void solve(){
		int n,k;
		n = scanner.nextInt();
		k = scanner.nextInt();

		long low = 0;
		long high = Integer.MAX_VALUE;
		long answer=0;
		while(low<=high){
			long mid = (low+high)/2;
			long sol = (mid - mid/n);
			if(k == sol){
				answer = mid;
				high = mid - 1;
			}else if(k < sol){
				high = mid-1;
			}else{
				low = mid+1;
			}
		}
		System.out.println(answer);
	}

	public static void main(String[] args) {
		int t = scanner.nextInt();
		while(t-->0){
			solve();
		}
	}
}