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

public class C {
    public static void main(String[] args){
        Scanner in = new Scanner(System.in);
        int t = in.nextInt();
        while (t > 0){
            solve(in.nextInt(), in.nextInt());
            t--;
        }
        in.close();
    }
    public static void solve(int n, int k){
        double x = Math.floor((double) (k-1)/ (n-1));
        int ans = k + ((int) x);
        System.out.println(ans);
    }
    public static void solve2(int n, int k){
        double x = Math.ceil((double) k / n);
        double y = Math.floor(x / n);
        int ans = k + ((int) y) + ((int) x);
        System.out.println(ans);
    }
    public static void solve1(int n, int k){
        int count = 0;
        int x = 1;
        while(count < k){
            if (x % n != 0) count++;
            x++;
        }
        System.out.println(x-1);
    }
}