#include <bits/stdc++.h>
using namespace std;
void solve() {
  long long x, y, k;
  cin >> x >> y >> k;
  long long cost = (k * y + k) / (x - 1);
  if ((k * y + k) - (cost * (x - 1) + 1) < 0) {
    while ((k * y + k) - (cost * (x - 1) + 1) <= 0) {
      cost--;
    }
    cost++;
  } else {
    while ((k * y + k) - (cost * (x - 1) + 1) > 0) {
      cost++;
    }
  }
  cout << cost + k << endl;
  return;
}
int main() {
  int t;
  cin >> t;
  while (t--) {
    solve();
  }
  return 0;
}
