#include <bits/stdc++.h>
using namespace std;
inline long long gi() {
  long long f = 1, x = 0;
  char c = getchar();
  while (c < '0' || c > '9') {
    if (c == '-') f = -1;
    c = getchar();
  }
  while (c >= '0' && c <= '9') x = x * 10 + c - '0', c = getchar();
  return f * x;
}
inline long long gl() {
  long long f = 1, x = 0;
  char c = getchar();
  while (c < '0' || c > '9') {
    if (c == '-') f = -1;
    c = getchar();
  }
  while (c >= '0' && c <= '9') x = x * 10 + c - '0', c = getchar();
  return f * x;
}
const long long N = 200003, M = N << 1;
long long n, m;
long long a[N], b[N];
char s[N];
signed main() {
  long long T = 1;
  T = gi();
  while (T--) {
    n = gi(), m = gi();
    long long now = m / (n - 1) + 1;
    if (m % (n - 1) == 0) --now;
    long long len = (now - 1) * n, len1 = (now - 1) * (n - 1);
    printf("%lld\n", len + m - len1);
  }
  return 0;
}

### Prompt

Your challenge is to write a cpp solution to the following 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

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
inline long long gi() {
  long long f = 1, x = 0;
  char c = getchar();
  while (c < '0' || c > '9') {
    if (c == '-') f = -1;
    c = getchar();
  }
  while (c >= '0' && c <= '9') x = x * 10 + c - '0', c = getchar();
  return f * x;
}
inline long long gl() {
  long long f = 1, x = 0;
  char c = getchar();
  while (c < '0' || c > '9') {
    if (c == '-') f = -1;
    c = getchar();
  }
  while (c >= '0' && c <= '9') x = x * 10 + c - '0', c = getchar();
  return f * x;
}
const long long N = 200003, M = N << 1;
long long n, m;
long long a[N], b[N];
char s[N];
signed main() {
  long long T = 1;
  T = gi();
  while (T--) {
    n = gi(), m = gi();
    long long now = m / (n - 1) + 1;
    if (m % (n - 1) == 0) --now;
    long long len = (now - 1) * n, len1 = (now - 1) * (n - 1);
    printf("%lld\n", len + m - len1);
  }
  return 0;
}

```