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

/**
 * Place here class purpose.
 *
 * @author Kirill
 * @since 21.10.2020
 */
public class Task1352C {
    public static void main(String[] args) throws IOException {
        Task1352C task1352C = new Task1352C();
        task1352C.resolve();
    }

    private void resolve() throws IOException {
        BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in));
        int testCount = Integer.parseInt(bufferedReader.readLine());

        StringBuilder result = new StringBuilder();
        for (int i = 0; i < testCount; i++) {
            String[] strings = bufferedReader.readLine().split(" ");
            int divider = Integer.parseInt(strings[0]);
            int needNumber = Integer.parseInt(strings[1]);

            int left = 1;
            while ((needNumber - left + 1) / divider > 0) {
                int tmp = (needNumber / divider) * divider + 1;
                needNumber += (needNumber - left + 1) / divider;
                left = tmp;
            }

            result.append(needNumber).append("\n");
        }

        System.out.println(result);
    }
}