#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 998244353;
inline ll Mod(ll a, ll b) {
    if (a > 0) {
        return a % b;
    }
    return b - abs(a % b);
}
ll Qpow(ll a, ll b) {
    ll res = 1, base = a;
    while (b > 0) {
        if (b % 2 == 1) {
            res = Mod(res * base, mod);
        }
        base = Mod(base * base, mod);
        b /= 2;
    }
    return res;
}
int main() {
    int T;
    cin >> T;
    for (int i = 0; i < T; ++i) {
        int a, b, k;
        cin >> a >> b >> k;
        if (k == 0) {
            cout << a << ' ' << b << '\n';
            continue;
        }
        if (k % 2 == 0) {
            ll t = k / 2;
            t = Qpow(2, t);
            cout << Mod(t * a, mod) << ' ' << Mod(t * b, mod);
        } else {
            ll t = (k + 1) / 2;
            t = Qpow(2, t - 1);
            cout << Mod(t * (a + b), mod) << ' ' << Mod(t * (a - b), mod);
        }
        cout << '\n';
    } 
    return 0;
}