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

ll ksm(ll x,ll n,ll mod){
    ll res = 1;
    x = x % mod;
    while(n > 0){
        if(n & 1) res = res * x % mod;
        x = x * x % mod;
        n >>= 1;
    }
    return res;
}


int main(){

    ll m = 998244353;

    ll T;
    scanf("%lld", &T);
    ll a, b, k;
    while(T--){
        scanf("%lld %lld %lld", &a, &b, &k);

        // ll a2 = a, b2 = b, k2 = k;

        a = a % m;
        b = b % m;

        if(k % 2 == 0){
            k = k / 2;
            a = ((ksm(2, k, m) * a)+m) % m;
            b = ((ksm(2, k, m) * b)+m) % m;
        }else{
            k = k / 2;
            ll c = (((ksm(2, k, m)) * (a + b))+m) % m;
            ll d = (((ksm(2, k, m)) * (a - b))+m) % m;
            a = (c + m) % m;
            b = (d + m) % m;
        }


        /*for(int i=0;i<k2;i++){
            ll c2 = a2 + b2 % m;
            ll d2 = a2 - b2 % m;
            a2 = c2 % m;
            b2 = d2 % m;
        }*/

        a = a + m % m;
        b = b + m % m;

        printf("%lld %lld\n", a, b);
        //printf("%lld %lld\n", a2, b2);
    }

    return 0;
}