#include <cstdio>
#include <cstring>
#include <string>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <vector>
#include <stack>
#include <sstream>
#include <map>
#include <set>
#include <queue>
#include <stdlib.h>
typedef long long ll;
ll mod = 998244353;
ll quick(ll a,ll n)
{
    ll re=1;
    while(n)
    {
        if(n&1) //判断n的二进制最后一位是不是1，或者说判断n是不是奇数
        {
            re=(re*a)%mod;
        }
        n>>=1;  //除掉n二进制的最后一位，相当于/2
        a=(a*a)%mod;
    }
    return re%mod;
}
using namespace std;
int main(){
    int T;
    cin >> T;
    while(T--){
        ll a,b,k;
        cin >> a >> b >> k;
        ll x = quick(2,k/2) % mod ;
        if(k%2==0){
            cout << (x * a) % mod << " " << (x * b) % mod << endl;
        }
        else{
            cout << (x * ((a+b)%mod)) % mod << " " << ( (x * (((a-b)%mod)+mod)%mod)) % mod << endl;
        }
    }
    return 0;
}