#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> PII;
const int maxn=111111,mod=998244353;
#define fi first
#define se second
#define MP make_pair
#define PB push_back
#define lson o<<1,l,mid
#define rson o<<1|1,mid+1,r
#define FOR(i,a,b) for(int i=(a);i<=(b);i++)
#define ROF(i,a,b) for(int i=(a);i>=(b);i--)
#define MEM(x,v) memset(x,v,sizeof(x))
inline ll read(){
    char ch=getchar();ll x=0,f=0;
    while(ch<'0' || ch>'9') f|=ch=='-',ch=getchar();
    while(ch>='0' && ch<='9') x=x*10+ch-'0',ch=getchar();
    return f?-x:x;
}
inline int qpow(int a,int b){
    int ans=1;
    for(;b;b>>=1,a=1ll*a*a%mod) if(b&1) ans=1ll*ans*a%mod;
    return ans;
}
void solve(){
    int a=read(),b=read(),k=read();
    int pw=qpow(2,k/2);
    a=1ll*a*pw%mod;
    b=1ll*b*pw%mod;
    if(k%2) printf("%d %d\n",(a+b)%mod,(a-b+mod)%mod);
    else printf("%d %d\n",a,b);
}
int main(){
    int T=read();
    while(T--) solve();
}
/*
a b
a+b a-b
2a 2b
*/