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 codechef; // don't place package name! */

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

/* Name of the class has to be "Main" only if the class is public. */
public class Main
{
    public static int divTermCount(int a, int num)  
    {  
        return num - num / a ;  
    } 
    public static int bs(int n, int k)
    {
        int l=1,h=Integer.MAX_VALUE,mid;
        while (l < h)  
        {  
            mid = l + (h - l) / 2;  
            if (divTermCount(n, mid) < k)  
                l = mid + 1;  
            else
                h = mid;  
        }  
      
        return l; 
    }
	public static void main (String[] args) throws java.lang.Exception
	{
		Scanner sc=new Scanner(System.in);
        
        int t=sc.nextInt();
        
        for(int l=0;l<t;l++)
        {
            int n=sc.nextInt();
            int k=sc.nextInt();
            
            int res=bs(n,k);
            System.out.println(res);
        }
	}
}