#include <bits/stdc++.h>
using namespace std;
void make_unique(vector<long long> vec) {
  sort((vec).begin(), (vec).end());
  vec.resize(unique((vec).begin(), (vec).end()) - vec.begin());
}
long long mpower(long long a, long long n, long long p) {
  long long res = 1;
  while (n) {
    if (n & 1)
      res = (res * a) % p, n--;
    else
      a = (a * a) % p, n /= 2;
  }
  return res;
}
long long modFact(long long n, long long p) {
  if (n >= p) return 0;
  long long result = 1;
  for (long long i = 1; i <= n; i++) result = (result * i) % p;
  return result;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  ;
  int t;
  cin >> t;
  while (t--) {
    long long l, k, p, a, b, c, n, m, i, j, flag = 0, count = 0, move = 0;
    long long x, y;
    cin >> x >> y >> k;
    long long need_sticks = ((y * k + k - 1) / (x - 1));
    if ((y * k + k - 1) % (x - 1))
      cout << need_sticks + k + 1 << '\n';
    else
      cout << need_sticks + k << '\n';
  }
  return 0;
}
