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:
/**
 * Author: Nirav Talaviya
 */

import java.io.*;
import java.util.*;

public class C1352 {
    static BufferedReader br;

    public static void main(String[] args) throws IOException {
        br = new BufferedReader(new InputStreamReader(System.in));
        int t =readInt();
        while(t-->0){
            long []arr = readlongarr();
            long n = arr[0];
            long k = arr[1];
            long l = k/(n-1);
            long m = k - l*(n-1);
            if(m==0)m=-1;
            long ans = l*n + m;
            System.out.println(ans);
        }
    }

    static int readInt() throws IOException {
        return Integer.parseInt(br.readLine());
    }

    static long readLong() throws IOException {
        return Long.parseLong(br.readLine());
    }

    static int[] readintarr() throws IOException {
        String[] ___str___ = br.readLine().split(" ");
        int[] ___arr___ = new int[___str___.length];
        for (int i = 0; i < ___str___.length; i++) {
            ___arr___[i] = Integer.parseInt(___str___[i]);
        }
        return ___arr___;
    }

    static long[] readlongarr() throws IOException {
        String[] ___str___ = br.readLine().split(" ");
        long[] ___arr___ = new long[___str___.length];
        for (int i = 0; i < ___str___.length; i++) {
            ___arr___[i] = Long.parseLong(___str___[i]);
        }
        return ___arr___;
    }
}