#include <bits/stdc++.h>
#include <atcoder/all>
#include <iostream>
#include <cmath>
using namespace std;
using namespace atcoder;
using ll = long long;
using lb = long double;
using P = pair<ll, ll>;
using T = tuple<ll, ll, ll>;
using vll = vector<ll>;
using vb = vector<bool>;
using vvll = vector<vector<ll>>;
using vP = vector<P>;
using Graph = vector<vector<ll>>;
using WGraph = vector<vector<pair<ll, ll>>>; // コスト、頂点番号の順
using mint = modint998244353;
//using mint = long double;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
mt19937_64 rng(58);
long double PI = 3.14159265358979;
const ll LLMAX = 9223372036854775807;
const ll INF = 1e18;
vector<ll> di = {-1, 0, 1, 0}; // 上左下右
vector<ll> dj = {0, -1, 0, 1};
template<typename T> inline bool chmax(T &a, T b) { return ((a < b) ? (a = b, true) : (false)); }
template<typename T> inline bool chmin(T &a, T b) { return ((a > b) ? (a = b, true) : (false)); }

void solve() {
    ll a, b, k;
    cin >> a >> b >> k;

    mint ans = 0;
    if (b == 0) {
        if (a <= 0) {
            cout << ans.val() << endl;
            return;
        }
        else {
            ans = (mint)a * (mint)k;
            cout << ans.val() << endl;
            return;
        }
    }
    if (a < 0 && b >= 0) {
        cout << ans.val() << endl;
        return;
    }

    ll A = abs(a);
    ll B = abs(b);
    ll shold = 0;
    if (A % (B - 1) == 0) shold = A / (B - 1);
    else shold = A / (B - 1) + 1;

    shold += (A - shold % A);
    if (k - shold / A < 0) {
        ans = (mint)a * (mint)k;
        cout << ans.val() << endl;
        return;
    } 
    k -= shold / A;
    

    ll cnt = 0;
    if (a < 0) cnt++;
    if (b < 0) cnt += k;
    
    vector<mint> Rb(40);
    Rb[0] = B;
    rep (i, 39) Rb[i + 1] = Rb[i] * Rb[i];
    auto power = [&](ll x) {
        mint res = 1;
        rep (i, 40) {
            if ((x >> i) & 1) res *= Rb[i]; // ansにしてた
        }
        return res;
    };
    if (cnt % 2 == 0) {
        ans = (mint)shold * power(k);
    }
    else {
        ll sh1 = 0, sh2 = 0;
        if (k != 0) sh1 = shold * A;
        if (shold != 0) sh2 = shold / A * B * B;

        if (sh1 > sh2) ans = (mint)sh1 * power(k - 1);
        else ans = (mint)sh2 * power(k - 1);
    }

    cout << ans.val() << endl;
}

int main() {
    ll t;
    cin >> t;
    rep (ti, t) solve();
    return 0;
}