#include <bits/stdc++.h>
using namespace std;
#define int long long
#define sc(x) scanf("%lld",&(x));
#define pb push_back
#define fi first
#define se second

#define maxn  5000000


int a,b;
int n,m,k;
int dp[5005][5005];
vector<int>G[5005];
int mod = 998244353;
int qp(int x,int n){
    int ans = 1;
    while(n){
        if(n&1){
            ans = (ans *x) %mod;
        }
        n >>= 1;
         x = x*x %mod;
    }
    return ans;
}
int T;
signed main(){
   sc(T)
   while(T--){
    sc(a)sc(b)sc(k)
    int q = (k-1)%2;
    int x = (k-1)/2;
    if(q == 0){
        cout << (qp(2,x)*(a+b))%mod << " " << (qp(2,x)*(a-b + mod)) %mod<< "\n";
    }else{
        cout << (qp(2,x+1)*a%mod) << " " << (qp(2,x+1)*b %mod)<<"\n";
    }

   }
}