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.ArrayList;
import java.util.List;
import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner cin =new Scanner(System.in);
        while (cin.hasNext()) {
            int t =cin.nextInt();
            for(int i=0;i<t;i++) {
                int n =cin.nextInt();
                int k =cin.nextInt();
//                solve2(n,k);

                solve3(n,k);
            }
        }
    }

    private static void solve3(int n, int k) {
        long ans =k;
        int temp =k;
        if(n>k) {
            System.out.println(ans);
            return;
        }
        int left = temp%n;
        int add =temp/n;

        while((add+left)>=n) {
            ans += add;
            int sum =add+left;
            add =sum/n;
            left =sum%n;
        }
        ans+=add;
//        ans+=left;
        System.out.println(ans);
    }

    private static void solve2(int n,int k) {
        if(n<k) {
            System.out.println("NO");
            return;
        }
        if((n-(k-1))%2==1) {
            System.out.println("YES");
            for(int i=0;i<k-1;i++) {
                System.out.print("1 ");
            }
            System.out.println(n-k+1);
            return;
        }
        if(n-(k-1)*2>0) {
            if((n-(k-1)*2)%2==0) {
                System.out.println("YES");
                for(int i=0;i<k-1;i++) {
                    System.out.print("2 ");
                }
                System.out.println(n-(k-1)*2);
                return;
            }
        }
        System.out.println("NO");
        return;
    }

    private static void solve(int x) {
        List<Integer> list =new ArrayList<>();
        int t=1;
        while (x>0) {
            int k=x%10*t;
            if(k>0) {
                list.add(k);
            }
            t*=10;
            x=x/10;
        }
        System.out.println(list.size());
        for(int i :list) {
            System.out.print(i+" ");
        }
        System.out.println("");
    }
}