#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef pair<int, int> pii;

const ll MOD = 998244353;

ll PowMod(ll a, ll n) {
    ll ans = 1;
    while (n) {
        if (n&1) ans = ans * a % MOD;
        a = a * a % MOD;
        n >>= 1;
    }
    return ans;
}

void solve() {
    ll a, b, k;
    scanf("%lld%lld%lld", &a, &b, &k);

    ll t = PowMod(2, k/2);
    (a *= t) %= MOD;
    (b *= t) %= MOD;
    if (k&1) {
        ll c = a + b, d = a - b;
        a = c, b = d;
    }
    a %= MOD, b %= MOD;
    if (a < 0) a += MOD;
    if (b < 0) b += MOD;
    printf("%lld %lld\n", a, b);
}

int main() {
    int T = 1;
    scanf("%d", &T);
    while (T--) solve();
    return 0;
}