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.*;

public class Solution {

    public static void main(String[] args) throws IOException {
        
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

        int t = Integer.parseInt(br.readLine());

        BufferedWriter output = new BufferedWriter(new OutputStreamWriter(System.out));

        StringTokenizer st;

        while (t-- > 0) {

            // int n = Integer.parseInt(br.readLine());

            st = new StringTokenizer(br.readLine());
            long n = Integer.parseInt(st.nextToken());
            long k = Integer.parseInt(st.nextToken());

            long n2 = n - 1;

            long div = k/n2;
            long mul = div*n;
            mul+= (k%n2 == 0)?-1:k%n2;

            output.write(mul + "\n");

        
            // int arr[] = new int[n];

            // for(int i = 0; i < n; i++)
            // {
            // int e = Integer.parseInt(st.nextToken());
            // arr[i] = e;
            // }


            // char arr[] = br.readLine().toCharArray();

            // output.write();
            // int n = Integer.parseInt(st.nextToken());

            // HashMap<Character, Integer> map = new HashMap<Character, Integer>();

            // if
            // output.write("YES\n");
            // else
            // output.write("NO\n");

            // long a = Long.parseLong(st.nextToken());
            // long b = Long.parseLong(st.nextToken());

            // if(flag == 1)
            // output.write("NO\n");
            // else
            // output.write("YES\n" + x + " " + y + " " + z + "\n");

            // output.write(n+ "\n");

        }

        output.flush();

    }

}