#include <bits/stdc++.h>
using namespace std;
long long power(long long base, long long pow) {
  long long ans = 1;
  while (1) {
    if (pow % 2 == 1 && pow != 1) {
      ans *= base;
    }
    pow /= 2;
    if (pow == 0) break;
    base = base * base;
  }
  return ans * base;
}
unordered_map<long long, long long> Fib;
long long fib(long long n) {
  if (n < 2) return 1;
  if (Fib.find(n) != Fib.end()) return Fib[n];
  Fib[n] =
      (fib((n + 1) / 2) * fib(n / 2) + fib((n - 1) / 2) * fib((n - 2) / 2)) %
      1000000007;
  return Fib[n];
}
void solve(long long test) {
  long long x, y, k;
  cin >> x >> y >> k;
  long long st_for_coal = y * k;
  long long stick_needed = k + st_for_coal - 1;
  x -= 1;
  long long man = (stick_needed + x - 1) / x + k;
  cout << man << endl;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long test;
  cin >> test;
  for (long long i = 1; i <= test; i++) {
    solve(i);
  }
  return 0;
}
