#include <bits/stdc++.h>
using namespace std;
const int M =998244353;
typedef long long int ll;
ll q_pow(ll x,ll n){
    if(n == 0)    return 1;
    ll res = q_pow(x * x % M,n/2);
    if(n & 1)    res = res * x % M;
    return res;
}
int main(){
    int t;
    cin >> t;
    while(t--){
        ll a, b;
        cin >> a >> b;
        ll k;
        cin >> k;
        ll p = q_pow(2, (k / 2));
        if (k % 2 == 1)
        {
            if(a-b<0)
                cout << p * (a + b) % M << ' ' << p * (a - b) % M +M<< endl;
            else
                cout << p * (a + b) % M << ' ' << p * (a - b) % M << endl;
       }else {
           cout << p * a % M << ' ' << p * b % M << endl;
       }
    }
    return 0;
}