#include<bits/stdc++.h>
using namespace std;
#define debug printf("%d %s\n",__LINE__,__FUNCTION__);fflush(stdout)
using ll=long long;using i64=long long;using db=double;
using u32=unsigned int;using u64=unsigned long long;using db=double;
using pii=pair<int,int>;using vi=vector<int>;
using qi=queue<int>;using pqi=priority_queue<int>;using si=set<int>;
#define pb push_back
#define mk make_pair
#define ins insert
#define era erase
#define fi first
#define se second
#define lowbit(x) x&-x
#define ALL(a) a.begin(),a.end()
const int INF=0x3f3f3f3f;
const ll INFLL=0x3f3f3f3f3f3f3f3f;
const double PI=acos(-1.0);
template<class T>inline bool chkmin(T&a,T b){return b<a?a=b,true:false;}
template<class T>inline bool chkmax(T&a,T b){return a<b?a=b,true:false;}
int _w,_t;FILE* _f;
#define MULTI_CASES

const int MOD=998244353;

int plu(int u,int v){
    return (u+v)%MOD;
}

int dec(int u,int v){
    return (u+MOD-v)%MOD;
}

int mul(int u,int v){
    return (1LL*u*v)%MOD;
}

int qpow(int u,int v){
    int res=1;
    while(v>0){
        if(v&1){
            res=mul(res,u);
        }
        u=mul(u,u);
        v>>=1;
    }
    return res;
}

int a,b,k;

void solve(){
    scanf("%d%d%d",&a,&b,&k);
    if(k&1){
        int u=plu(a,b),v=dec(a,b);
        a=u;b=v;
        --k;
    }
    k>>=1;
    a=mul(a,qpow(2,k));
    b=mul(b,qpow(2,k));
    printf("%d %d\n",a,b);
}

int main(){
    #ifdef MULTI_CASES
    _w=scanf("%d",&_t);while(_t--)
    #endif
    solve();
    return 0;
}