#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
ll T, a, b, k, MOD = 998244353;

ll qpow(ll a, int n){
    long long ans = 1;
    while(n){
        if(n&1)        //如果n的当前末位为1
            ans = (ans * a) % MOD;  //ans乘上当前的a
        a = (a * a)%MOD;        //a自乘
        n >>= 1;       //n往右移一位
    }
    return ans%MOD;
}

int main()
{
    scanf("%lld", &T);
    while(T--){
        scanf("%lld %lld %lld", &a, &b, &k);
          ll t = qpow(2, k/2);
        ll c = (a+b)%MOD, d = (a-b) * t;
        if(d < 0)
            d = d%MOD + MOD;
          if(k%2== 0)
              printf("%lld %lld", (t * a) % MOD, (t * b )% MOD);
        else
            printf("%lld %lld", (t * c % MOD) % MOD, d% MOD);
     printf("\n");
    }
    return 0;
    
}