#include<bits/stdc++.h>
using namespace std;
const int mod=998244353;
int n,T,a,b,k,A,B;
int kissme(int a,int x)
{
    int ret=1;
    for(;x;x>>=1,a=1ll*a*a%mod) if(x&1) ret=1ll*ret*a%mod;
    return ret; 
}
int main()
{
    scanf("%d",&T);
    while(T--)
    {
        scanf("%d%d%d",&a,&b,&k);
        int t=kissme(2,k/2);
        a=1ll*a*t%mod,b=1ll*b*t%mod;
        if(k&1) A=(a+b)%mod,B=(a-b+mod)%mod;
        else A=a,B=b;
        printf("%d %d\n",A,B);
    }
    return 0;
 }