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;
long long int maxx = INT_MIN;
long long int minx = INT_MAX;
vector<long long int> readArr(vector<long long int> &a, long long int n) {
  for (long long int i = 0; i < n; i++) {
    long long int x;
    cin >> x;
    a.push_back(x);
  }
  return a;
}
int main() {
  long long int t;
  cin >> t;
  while (t--) {
    long long int n, k;
    cin >> n >> k;
    unsigned long long int l = 0;
    unsigned long long int r = 1e14;
    while (1) {
      unsigned long long int mid = l + (r - l) / 2;
      unsigned long long int cmp = mid - mid / n;
      if (k == cmp) {
        if (mid % n)
          cout << mid << endl;
        else
          cout << mid - 1 << endl;
        break;
      } else if (k > cmp) {
        l = mid + 1;
      } else {
        r = mid - 1;
      }
    }
  }
  return 0;
}