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:
//created by Whiplash99
import java.io.*;
import java.util.*;
public class C
{
    private static long bS(long N, long K)
    {
        long l=1, r=(long)(1e18), mid, ans=-1;
        while (l<=r)
        {
            mid=(l+r)/2;

            long tmp=mid/N, tmp2=mid%N;
            tmp*=(N-1);
            tmp+=tmp2;

            if(tmp==K)
            {
                return (mid%N==0)?(mid-1):mid;
            }
            else if(tmp<K) l=mid+1;
            else r=mid-1;
        }
        return -1;
    }
    public static void main(String[] args) throws IOException
    {
        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));

        int i;

        int T=Integer.parseInt(br.readLine().trim());
        StringBuilder sb=new StringBuilder();

        while(T-->0)
        {
            String s[]=br.readLine().trim().split(" ");
            long N=Long.parseLong(s[0]);
            long K=Long.parseLong(s[1]);

            sb.append(bS(N,K)).append("\n");
        }
        System.out.println(sb);
    }
}