#pragma GCC optimize(2)
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
// 之差至少2
const int maxn=1e7+100;
ll P=998244353;

long long qpow(long long n,long long m)  //快速幂模板
{
    long long ans = 1;
    while(m){
        if(m & 1) ans = ans*n%P;
        n = n*n%P;
        m /= 2;
    }
    return ans;
}
int main(){
    int t;
    cin>>t;
        while(t--){
        ll a,b,c;
        cin>>a>>b>>c;
   
        
        ll x=c/2;
        ll ans=qpow(2,x);
        ll ans1,ans2;
        if(c%2==0){
            ans1=ans*a,ans2=ans*b;
            if(ans1<0)ans1+=P*9239593500;
            if(ans2<0)ans2+=P*9239593500;
            cout<<ans1%P<<" "<<ans2%P<<endl;
        }
        else{
            ans1=(a*ans+b*ans+P),ans2=(a*ans-b*ans+P);
            if(ans1<0)ans1+=9239593500*P;
            if(ans2<0)ans2+=9239593500*P;
            ans1%=P;
            ans2%=P;
            cout<<ans1<<" "<<ans2<<endl;
        } 
    }
    
    
    return 0;
}