#include<iostream>
#include<algorithm>
#include<cstring>
#include<vector>
#include<set>
#include<queue>
#include<stack>
#include<map>
#include<cmath>
using namespace std;
const int N = 1000003, M = 10003, inf = 0x3f3f3f3f, mod = 1e9 + 7;
const double eps = 1e-5;
typedef pair<int, int> PIR;
typedef long long ll;
//推导出公式直接计算
int main()
{
int t;
cin >> t;
while (t--)
{
int x, y, k;
cin >> x >> y >> k;
ll res = k;
ll t = (ll)k * y + k - 1;
if (t % (x - 1) == 0)
res += t / (x - 1);
else
res += t / (x - 1) + 1;
cout << res << endl;
}
return 0;
}