/**
*   author:     roccoshi
*   created:    2021-08-01 15:46:15
*/
#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int mod = 998244353;
const int inf = 0x3f3f3f3f; 
const int ninf = 0xc0c0c0c0;
const int maxn = 10000 + 5;
// quick pow
ll qpow(ll x, ll y, ll mod)  {
    ll ans = 1;
    while (y) {
        if(y & 1) ans = ans * x % mod;
        x = x * x % mod;
        y >>= 1;
    }
    return ans;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    ll t;
    cin >> t;
    while (t--) {
        ll a, b, k;
        cin >> a >> b >> k;
        ll c = (a + b) % mod, d = ((a - b) % mod + mod) % mod;
        ll xx = qpow(2, k / 2, mod);
        if (k & 1) {
            cout << ((c * xx) % mod + mod) % mod << ' ' << ((d * xx) % mod + mod) % mod << endl; 
        } else {
            cout << ((a * xx) % mod + mod) % mod << ' ' << ((b * xx) % mod + mod) % mod << endl; 
        }
    }  
    return 0;
}