找规律

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>
typedef long long ll;
int main()
{
    ll p;
    scanf("%lld",&p);
    while(p--)
    {
        ll a,b,c,k;
        scanf("%lld %lld",&a,&b);
        c=a-1;
        if(b%c==0)
        {
            k=a*(b/c)-1;
        }
        else
        {
            k=a*(b/c)+b%c;
        }
        printf("%lld\n",k);
    }
}