#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
typedef  long long ll;
const ll MOD=998244353;
//const int
int T,k;
ll a,b,outa,outb,tmp1,tmp2;
ll ksm(int x){
    ll ans=1,a=2;
    while(x){
        if(x&1)
            ans=(ans*a)%MOD;
        a=(a*a)%MOD;
        x>>=1;
    }
    return ans%MOD;
}
int main(){
    scanf("%d",&T);
    while(T--){
        scanf("%lld%lld%d",&a,&b,&k);
        ll mul=ksm(k>>1);//2^k>>1
        if(k&1){
            outa=((a+b)*mul)%MOD;
            outb=((a-b)*mul)%MOD;
        }
        else{
            outa=(a*mul)%MOD;
            outb=(b*mul)%MOD;
        }
        if(outb<0) outb+=MOD;
        printf("%lld %lld\n",outa,outb);
    }
    return 0;
}