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

const int p = 998244353;

int qpow(int a, int b) {
    if (!b) return 1;
    int t = qpow(1ll * a * a % p, b >> 1);
    return b & 1 ? 1ll * t * a % p : t;
}

void solve() {
    int a, b, k;
    scanf("%d %d %d", &a, &b, &k);
    if (k & 1) {
        int _a = a, _b = b;
        a = (_a + _b) % p;
        b = (_a - _b + p) % p;
    }
    a = 1ll * a * qpow(2, k >> 1) % p;
    b = 1ll * b * qpow(2, k >> 1) % p;
    printf("%d %d\n", a, b);
}

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