#include <iostream>
#include<cstdio>
using namespace std;
typedef long long ll;
const int mod=998244353;
ll quick_pow(ll a,ll b)
{
    ll ans=1;
    while(b)
    {
        if(b%2==1) ans=(ans*a)%mod;
        a=(a*a)%mod;
        b=b/2;
    }
    return ans;
}
int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        ll a,b,k;
        //scanf("%lld%lld%lld",&a,&b,&k);
        cin>>a>>b>>k;
        if(k%2==0)
        {
            k=k/2;
            //printf("%lld %lld\n",((quick_pow(2,k)%mod)*(a%mod))%mod,((quick_pow(2,k)%mod)*(b%mod))%mod);
            cout<<(quick_pow(2,k)*a)%mod<<' '<<(quick_pow(2,k)*b)%mod<<'\n';
        }
        else
        {
            k=(k-1)/2;
            //printf("%lld %lld\n",((quick_pow(2,k)%mod)*((a+b)%mod))%mod,((quick_pow(2,k)%mod)*((a-b)%mod))%mod);
            cout<<(quick_pow(2,k)*(a+b))%mod<<' '<<(((quick_pow(2,k)*(a-b))%mod)+mod)%mod<<'\n';
        }
    }
    return 0;
}