#include <bits/stdc++.h>
using namespace std;
const int M = 1000000007;
const int inf = 1e9;
const unsigned long long linf = 1e18;
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
template <typename T, typename V>
void __print(const pair<T, V> &x) {
  cerr << '{';
  __print(x.first);
  cerr << ',';
  __print(x.second);
  cerr << '}';
}
template <typename T>
void __print(const T &x) {
  int f = 0;
  cerr << '{';
  for (auto &i : x) cerr << (f++ ? "," : ""), __print(i);
  cerr << "}";
}
void _print() { cerr << "]\n"; }
template <typename T, typename... V>
void _print(T t, V... v) {
  __print(t);
  if (sizeof...(v)) cerr << ", ";
  _print(v...);
}
unsigned long long power(unsigned long long x, unsigned long long n) {
  unsigned long long res = 1;
  while (n > 0) {
    if (n & 1) res = res * x % M;
    x = x * x % M;
    n >>= 1;
  }
  return res;
}
unsigned long long modinverse(unsigned long long a) { return power(a, M - 2); }
void solve() {
  unsigned long long x, y, k;
  cin >> x >> y >> k;
  unsigned long long cst_of_coal = k * y;
  unsigned long long cnt = 0, tmp = x;
  unsigned long long sticks = x;
  cnt = 1;
  cnt += ((k * y) + x - 1 - sticks) / (x - 1);
  sticks += ((cnt - 1) * (x - 1));
  ;
  cnt += k;
  sticks -= (k * y);
  ;
  if (sticks >= k) {
    cout << cnt << '\n';
    return;
  }
  cnt += (k - sticks) / (x - 1);
  if ((k - sticks) % (x - 1) != 0) cnt++;
  cout << cnt << '\n';
}
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int t;
  cin >> t;
  while (t--) solve();
  return 0;
}
