#include <bits/stdc++.h>
using namespace std;
const int mod = (int)1000000000 + 7;
const int MOD = (int)998244353;
const int INF = (int)1e18;
bool cmp(const pair<int, int>& a, const pair<int, int>& b) {
  return a.second - a.first < b.second - b.first;
}
long long bit_ct1(long long x) {
  long long ct = 0;
  while (x > 0) {
    x = x & (x - 1);
    ct++;
  }
  return ct;
}
void solve() {
  long long n, k;
  cin >> n >> k;
  long long p;
  p = (k) / (n - 1);
  if (k % (n - 1)) p++;
  k = (n * (p)-p) - k;
  cout << n * p - k - 1 << '\n';
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long t = 1;
  cin >> t;
  while (t--) {
    solve();
  }
  clock_t timest = clock();
  cerr << "[Executes in " << (double)(clock() - timest) / CLOCKS_PER_SEC << "s]"
       << '\n';
}
