#include <stdio.h>//#include <bitsdc++.h>
#include <math.h>
#include <iostream>
#include <string.h>
#include <stdio.h>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <cstdio>
using namespace std;

const long long mod = 998244353 ;
typedef long long ll;


ll fpow(ll a,ll n)
{
    ll base=a;
    ll res=1;
    while(n) {
        if(n&1)
            res=base*res%mod;
        base=base*base%mod;
        n>>=1;
    }
    return res;
}

int main()
{
    int T=1;
    scanf("%d",&T);
    for(int i=1; i<=T; i++) {
            ll a,b,k;
    scanf("%lld%lld%lld",&a,&b,&k);
    ll base=k/2;
    ll p=fpow(2,base);
    ll aa=a,bb=b;
    if(k&1) {
        aa=a+b;
        bb=a-b;
    }
    aa=aa*p%mod+mod;
    bb=bb*p%mod+mod;
    printf("%lld %lld\n",aa%mod,bb%mod);
    }
    return 0;
}