#include<iostream>
#include<algorithm>
#include<cstring>
#include<vector>
#include<queue>
#include<cmath>

using namespace std;
typedef long long ll;
const int mod=998244353;
//const int maxn=;

namespace IO{
    char buf[1<<20],*P1=buf,*P2=buf;
    #define gc() getchar()
    //#define gc() (P1==P2&&(P2=(P1=buf)+fread(buf,1,1<<20,stdin),P1==P2)?EOF:*P1++)
    #define TT template<class T>inline
    TT void read(T&x)
    {
        x=0;register char c=gc();register bool f=0;
        while(c<48||c>57){f^=c=='-',c=gc();}
        while(47<c&&c<58)x=(x<<3)+(x<<1)+(c^48),c=gc();
        if(f)x=-x;
    }
    inline void write(ll x)
    {
        int t[20]={0},cnt=0;
        while(x)t[++cnt]=x%10,x/=10;
        if(!cnt)putchar('0');
        else while(cnt)putchar(t[cnt--]+'0');
        puts("");
    }
};
using namespace IO;

ll qpow(ll a,ll b)
{
    ll ans=1;
    while(b)
    {
        if(b&1)ans=ans*a%mod;
        b>>=1; a=a*a%mod;
    }
    return ans;
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
    int t; cin>>t;
    while(t--)
    {
        ll a,b,k; cin>>a>>b>>k;
        if(k%2==0)cout<<qpow(2,k/2)*a%mod<<" "<<qpow(2,k/2)*b%mod<<"\n";
        else
        {
            ll c=qpow(2,k/2)*a%mod,d=qpow(2,k/2)*b%mod;
            cout<<((c+d)%mod+mod)%mod<<" "<<((c-d)%mod+mod)%mod<<"\n";
        }
    }
    return 0;
}