func_code_string: #include <bits/stdc++.h>   using namespace std;   const long long N = 1e9 + 7;   map<long long, long long> factorize(long long n) {     map<long long, long long> ans;     for (long long i = 2; i * i <= n; i++) {       while (n % i == 0) {         ans[i]++;         n /= i;       }     }     if (n > 1) {       ans[n]++;       n = 1;     }     return ans;   }   void FAST() {     ios::sync_with_stdio(0);     cin.tie(0);     cout.tie(0);   }   long long binpow(long long a, long long b, long long m) {     a %= m;     long long res = 1;     while (b > 0) {       if (b & 1) res = res * a % m;       a = a * a % m;       b >>= 1;     }     return res;   }   int main() {     FAST();     long long t;     cin >> t;     while (t--) {       long long x;       cin >> x;       long long y;       cin >> y;       long long k;       cin >> k;       long long reqy = y * k;       if ((k * (y + 1) - 1) % (x - 1)) {         cout << (k * (y + 1) - 1) / (x - 1) + k + 1 <<   n ;       } else         cout << (k * (y + 1) - 1) / (x - 1) + k <<   n ;     }   }   