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 C_K_th_Not_Divisible_by_n {

    static class FastReader {
        BufferedReader br;
        StringTokenizer st;

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

        String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

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

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

        double nextDouble() {
            return Double.parseDouble(next());
        }

        String nextLine() {
            String str = "";
            try {
                str = br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }
    }

    public static void main(String[] args) {
        FastReader scan = new FastReader();
        int t = scan.nextInt();
        while (t-- > 0) {
            int n = scan.nextInt();
            int k = scan.nextInt();

            if (n > k) {
                System.out.println(k);
                continue;
            }
            if (n == k) {
                System.out.println(n + 1);
                continue;
            }
            int group = 0;

            if (k % n == 0) {
                group = (int) Math.ceil((double) k / (n - 1));
            } else {
                group = (int) Math.ceil((double) k / (n - 1));
            }

            int prevMultiple = (group - 1) * n;
            int prevPassed = (group - 1) * (n - 1);

            // while (prevPassed != k) {
            // prevMultiple++;
            // prevPassed++;
            // }

            int diff = k - prevPassed;
            int ans = prevMultiple + diff;

            // System.out.println(group);
            // System.out.println(prevMultiple);
            // System.out.println(prevPassed);
            System.out.println(ans);

        }
    }
}