#include <bits/stdc++.h>
using namespace std;
bool cmp(pair<long long, long long> p1, pair<long long, long long> p2) {
  if (p1.first == p2.first)
    return p1.second > p2.second;
  else
    return p1.first < p2.first;
}
int main() {
  int t;
  cin >> t;
  while (t--) {
    long long n, k;
    cin >> n >> k;
    long long high = 3 * (long long)pow(10, 9), low = 1, ans = -1;
    while (low <= high) {
      long long mid = (low + high) / 2;
      if ((mid - ((long long)mid / n)) == k) {
        long long j = mid;
        while ((j - ((long long)j / n)) == k) {
          j--;
        }
        ans = j + 1;
        break;
      } else if ((mid - ((long long)mid / n)) > k) {
        high = mid - 1;
      } else {
        low = mid + 1;
      }
    }
    cout << ans << endl;
  }
  return 0;
}
