#include <bits/stdc++.h>
using namespace std;

const int P = 998244353;

long long fastpow(long long x, long long n) {
    long long r = 1;
    for (x %= P; n; n >>= 1, x = x * x % P)
        if (n & 1) r = r * x % P;
    return r;
}

void solve() {
    long long a, b, k;
    scanf("%lld %lld %lld", &a, &b, &k);
    long long t = k / 2;
    a = a * fastpow(2, t) % P;
    b = b * fastpow(2, t) % P;
    if (k & 1) {
        long long _a = (a + b + P) % P;
        long long _b = (a - b + P) % P;
        a = _a; b = _b;
    }
    printf("%lld %lld\n", a, b);
}

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