#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll qpow(ll x, ll n,ll mod) {
     ll res = 1;
     while (n) {
        if (n & 1)
            res = res * x%mod;    //如果二进制最低位为1，则乘上x^(2^i) 
        x = x * x%mod;            //将x平方 
       n >>= 1;                    //n/2

    }
     return res;
}
int main()
{
    ll n; cin >> n;
    while (n--)
    {
        ll a, b, k;
        cin >> a >> b >> k;
        ll n = k / 2;
        ll flag = k % 2;
        if (flag)
        {
            ll ta = (ll)(a + b) * qpow(2,n, 998244353) % 998244353;
            ll tb = (ll)(a - b+ 998244353) * qpow(2, n, 998244353) % 998244353;
            cout << ta << " " << tb << endl;
        }
        else
        {
            ll ta = (ll)a* qpow(2, n, 998244353) % 998244353;
            ll tb = (ll)b * qpow(2, n, 998244353) % 998244353;
            cout << ta  << " " << tb  << endl;
        }
    }
}