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:
//package codeforces;

import java.util.ArrayList;
import java.util.Scanner;

public class KNotDivisiblebyN {

    public static void main(String []args) {

        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        while ( n > 0) {
            long x = sc.nextLong();
            long y = sc.nextLong();
            long m = x;
            ArrayList<Long> longs = new ArrayList<>();

            long dif1 = y/(x - 1);
            long z = dif1*(x);
            if(y - dif1*(x-1) == 0) {
                long diff = y - dif1 * (x - 1) + z;
                System.out.println(diff - 1);
            } else {
                long diff = y - dif1 * (x - 1) + z;
                System.out.println(diff);
            }
            n--;
        }
    }
}