#include <bits/stdc++.h>
using namespace std;

#define int long long
#define debug(x) cout<<#x<<" "<<x<<endl;

const int N=1e6+5;
const double eps=1e-9;
const int INF=1e18;


int pow_mod(int a, int n, int m)
{
    if(n == 0) return 1;
    int x = pow_mod(a, n/2, m);
    long long ans = (long long)x * x % m;
    if(n % 2 == 1) ans = ans *a % m;
    return (int)ans;
}

signed main()
{
    //freopen("a.in","r",stdin);
    //freopen("a.out","w",stdout);
    int t;
    cin>>t;
    while(t--)
    {
    int a,b,k;
    int p=998244353;
    scanf("%lld%lld%lld",&a,&b,&k);
    int x1=pow_mod(2,k/2,998244353);
    int x2=pow_mod(2,k/2,998244353);
    x1=x1*a%p,x2=x2*b%p;
    if(k&1) printf("%lld %lld\n",(x1+x2)%p,(x1-x2+p)%p);
    else printf("%lld %lld\n",x1,x2);
    }
    return 0;
}