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.io.DataInputStream;
import java.io.IOException;

public class p3 {
    static class FastReader{
        final private int BUFFER_SIZE = 1<<16;
        private DataInputStream din;
        private byte[] buffer;
        private int bufferPointer, bytesRead;

        public FastReader(){
            din = new DataInputStream(System.in);
            buffer = new byte[BUFFER_SIZE];
            bufferPointer = bytesRead = 0;
        }

        private void fillBuffer() throws IOException {
            bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE);
            if (bytesRead == -1) buffer[0] = -1;
        }

        private byte read() throws IOException{
            if (bufferPointer == bytesRead) fillBuffer();
            return buffer[bufferPointer++];
        }

        public int nextInt() throws IOException{
            int ret = 0;
            byte c = read();
            while(c<=' ') c = read();
            do{
                ret = ret*10+c-'0';
            } while((c = read())>='0' && c<='9');
            return ret;
        }

    }

    public static void main(String[] args) throws IOException{
        FastReader in = new FastReader();
        int n = in.nextInt();
        while(n>0){
            int m = in.nextInt();
            int p = in.nextInt();
            int res = p/(m-1)*m;
            int p0 = p/(m-1)*(m-1);
            if (p0 == p) {
                System.out.println(res-1);
                n--;
                continue;
            }
            res = res+p-p0;
            System.out.println(res);
            n--;
        }
    }
}