#include <iostream>
#include <cstdio>
#include <algorithm>
#include <memory.h>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
#define M 200005
const long long mod=998244353;
ll a,b,k;
ll qpow(ll a,ll b)
{
    ll ans=1;
    while(b)
    {
        if(b&1)
            ans=ans*a%mod;
        a=a*a%mod;
        b>>=1;
    }
    return ans;
}
int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        scanf("%lld%lld%lld",&a,&b,&k);
        ll aa=a+b+mod,bb=a-b+mod;
        if(k&1) cout<<qpow(2,k/2)*aa%mod<<" "<<qpow(2,k/2)*bb%mod<<endl;
        else cout<<qpow(2,k/2)*a%mod<<" "<<qpow(2,k/2)*b%mod<<endl;
    }
    return 0;
}