#include<bits/stdc++.h>
using namespace std;
#define rep(i,s,t) for(int i=s;i<=t;++i)
#define per(i,s,t) for(int i=s;i>t;--i)
#define dd(x) cout<<#x<<" = "<<x<<" "
#define de(x) cout<<#x<<" = "<<x<<"\n"
#define sz(x) x.size()
#define pb push_back
#define lson k<<1,l,mid
#define rson k<<1|1,mid+1,r
#define mp make_pair
#define fi first
#define se second
typedef long long ll;
typedef double db;
typedef pair<int,int> pii;
const int N=4e5+11;
const int mod=998244353;
int C[2][2]={{1,1},{1,-1}},D[2][2],res[2][2];
int T,a,b,k;
void mul(int a[2][2],int b[2][2]){
    int res[3][3]={};
    rep(k,0,1)
        rep(i,0,1)
            rep(j,0,1)
                res[i][j]=(res[i][j]+1ll*a[i][k]*b[k][j])%mod;
    rep(i,0,1)
        rep(j,0,1)
            a[i][j]=res[i][j];
}
int main(){
    scanf("%d",&T);
    while(T--){
        scanf("%d%d%d",&a,&b,&k); 
        rep(i,0,1)
            rep(j,0,1)
                D[i][j]=C[i][j];
        res[0][0]=res[1][1]=1;
        res[0][1]=res[1][0]=0;
        for(;k;k>>=1,mul(D,D))
        if(k&1)
            mul(res,D); 
        int A=(1ll*a*res[0][0]+1ll*b*res[0][1])%mod,
            B=(1ll*a*res[1][0]+1ll*b*res[1][1])%mod;
        A=(A+mod)%mod,B=(B+mod)%mod;
        printf("%d %d\n",A,B);
    }
    return 0;
}