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

public class Solution {

    public static BufferedWriter bw;
    public static FastReader sc;

    public static void main(String[] args) throws Exception {
        sc = new FastReader();
        bw = new BufferedWriter(new OutputStreamWriter(System.out));
        int t = sc.nextInt();
        while (t > 0) {
            t--;
            int k = sc.nextInt();
            int n = sc.nextInt();
            long ans = solve(k, n);
            bw.write(ans + "\n");
        }
        bw.close();
    }

    private static long solve(int k, int n) {
        long ans = n;
        long prev = 0;
        while (true) {
            long q2 = ans / k;
            long q1 = prev / k;
            if (q1 == q2)
                return ans;

            prev = ans;
            ans += (q2 - q1);
        }
    }

}


class FastReader {
    BufferedReader br;
    StringTokenizer st;

    public FastReader() {
        br= new BufferedReader(new InputStreamReader(System.in));

    }

    public String next() {
        if (st == null || !st.hasMoreTokens()) {
            try {
                st = new StringTokenizer(br.readLine());
            } catch (IOException e) {

            }
        }
        return st.nextToken();
    }

    public int nextInt() {
        return Integer.parseInt(next());
    }

    public long nextLong() {
        return Long.parseLong(next());
    }
}