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 CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
int arr[105];
vector<int> graph[105];
int node;
int dp[105][105];
int main() {
  int x, y;
  long long T, n, k;
  vector<int> v;
  map<int, int> freq;
  int n0, n1, n2;
  cin >> T;
  while (T--) {
    cin >> n >> k;
    long long temp = k, sum = 0;
    int rem = 0;
    while (temp > 0) {
      temp += rem;
      rem = temp % n;
      sum += temp / n;
      temp /= n;
    }
    k += sum;
    if (k % n == 0) {
      cout << k + 1 << endl;
    } else
      cout << k << endl;
  }
  return 0;
}