#include <bits/stdc++.h>
#define ll long long
#define MOD 998244353ll
using namespace std;
int T;
ll a, b, k;
ll tmp, tmpa, tmpb;
ll qpow(ll a, ll b, ll p) {
    a %= p;
    ll res = 1;
    while (b > 0) {
        if (b & 1) res = res * a % p;
        a = a * a % p;
        b >>= 1;
    }
    return res;
}
ll mul(ll a, ll b, ll p) { return a * b % p; }
void solve() {
    scanf("%lld%lld%lld", &a, &b, &k);
    if (k & 1) {
        tmpa = a + b;
        tmpb = a - b;
        a = tmpa % MOD;
        b = tmpb % MOD;
        if (a < 0) {
            a = (a + MOD) % MOD;
        }
        if (b < 0) {
            b = (b + MOD) % MOD;
        }
        --k;
    }
    k /= 2;
    tmp = qpow(2, k, MOD);
    printf("%lld %lld\n", mul(a, tmp, MOD), mul(b, tmp, MOD));
}
int main() {
    scanf("%d", &T);
    while (T--) {
        solve();
    }
}