#include<iostream>
using namespace std;

const long long mod = 998244353;

long long qpow(long long a,long long n)
{
    long long ans = 1;
    while(n)
    {
        if(n&1) ans = (ans*a)%mod;  
        a = a*a%mod;        
        n /= 2;
    }
    return ans;
}

int main()
{
    long long t,a,b,k;
    cin>>t;
    while(t--)
    {
        cin>>a>>b>>k;
        long long x=qpow(2,k/2);
        if(k%2==0) cout<<(x*a)%mod<<" "<<(x*b)%mod<<endl;
        else cout<<((x*a)%mod+(x*b)%mod)%mod<<" "<<((x*a)%mod-(x*b)%mod+mod)%mod<<endl;
    }
    return 0;
}