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.
The first line contains an integer tt (1≤t≤1000) — the number of test cases in the input. Next, tt test cases are given, one per line.
Each test case is two positive integers nn (2≤n≤pow(10,9)) and k(1≤k≤pow(10,9)).
OutputFor 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
#include <stdio.h>
#include <iostream>
#include <string.h>
#include <algorithm>
using namespace std;
int main()
{
long long x,y,g,s;
int t;
cin>>t;
while(t--)
{
cin>>x>>y;
if(x>y) printf("%lld\n",y);
else
{
s=y+y/(x-1);
if(y%(x-1)==0)
s--;
printf("%lld\n",s);
}
}
}