#include <iostream>
#include <stdio.h>
#include <cstring>
#include <algorithm>
#include <cmath>
using namespace std;
const long long mod=998244353;
typedef long long ll;
ll power(ll a,ll b)
{
    ll ans=1,base=a;
    while(b!=0)
    {
        if(b&1)
            ans=((ans%mod)*(base%mod))%mod;
        base=((base%mod)*(base%mod))%mod;
        b>>=1;
    }
    return ans%mod;
}
int main()
{
    ll t;
    cin>>t;
    while(t--)
    {
        ll a,b,k;
        cin>>a>>b>>k;
        if(k%2==0)
        {
            if(k==0)
            {
                cout<<a%mod<<" "<<b%mod<<endl;
            }
            else
            {
                ll a_ans=((power(2,k/2)%mod)*(a%mod))%mod;
                ll b_ans=((power(2,k/2)%mod)*(b%mod))%mod;
                if(a_ans<0)
                {
                    a_ans+=mod;
                }
                if(b_ans<0)
                {
                    b_ans+=mod;
                }
                cout<<a_ans<<" "<<b_ans<<endl;
            }
        }
        else
        {
            ll a_ans=(((power(2,k/2)%mod)*(a%mod))%mod+((power(2,k/2)%mod)*(b%mod))%mod)%mod;
            ll b_ans=(((power(2,k/2)%mod)*(a%mod))%mod-((power(2,k/2)%mod)*(b%mod))%mod)%mod;
            if(a_ans<0)
                {
                    a_ans+=mod;
                }
                if(b_ans<0)
                {
                    b_ans+=mod;
                }
            cout<<a_ans<<" "<<b_ans<<endl;
        }
    }
    return 0;
}