#include <bits/stdc++.h>
using namespace std;
void fprime(int n, bool prime[]) {
  memset(prime, true, sizeof(prime));
  for (int i = 2; i * i <= n; i++) {
    if (prime[i] == true) {
      for (int j = i * i; j <= n; j += i) prime[j] = false;
    }
  }
}
long long power(long long x, unsigned int y, long long p) {
  long long res = 1;
  x = x % p;
  if (x == 0) return 0;
  while (y > 0) {
    if (y & 1) res = (res * x) % p;
    y = y >> 1;
    x = (x * x) % p;
  }
  return res;
}
bool myComparison(const pair<long long, long long> &a,
                  const pair<long long, long long> &b) {
  return a.second < b.second;
}
long long ceildiv(long long a, long long b) { return (a + b - 1) / b; }
int main() {
  int t;
  cin >> t;
  while (t--) {
    long long x, y, k, ans;
    cin >> x >> y >> k;
    ans = ceildiv(k + (y * k) - 1, x - 1);
    ans += k;
    cout << ans << '\n';
  }
  return 0;
}
