#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>

//#include <atcoder/convolution>
//#include <atcoder/modint> 
//using Modint = atcoder::modint998244353;

using namespace std;
typedef long long ll;

void ex_gcd(ll a, ll b, ll &d, ll &x, ll &y) {
  if (!b) {
    d = a;
    x = 1;
    y = 0;
  } else {
    ex_gcd(b, a % b, d, y, x);
    y -= a / b * x;
  }
}
ll inv(ll a, ll n) {
  ll d, x, y;
  ex_gcd(a, n, d, x, y);
  return d == 1 ? (x % n + n) % (n / d) : -1;
}
ll gcd(ll x, ll y) {
  if (y == 0) return x;
  return gcd(y, x % y);
}

int gcd(int x, int y) {
  if (y == 0) return x;
  return gcd(y, x % y);
}

inline void scan_d(int &ret) {
    char c; ret=0;
    while((c=getchar())<'0'||c>'9');
    while(c>='0'&&c<='9') ret=ret*10+(c-'0'),c=getchar();
}

const int maxn = 100005;
const int mod = 998244353;

ll cal(int n){
  ll ret = 1;
  ll cur = 2;
  while(n>0){
    if(n&1)ret = ret * cur % mod;
    cur = cur * cur%mod;
    n>>=1;
  }
  return ret;
}

int main() {
#ifdef suiyuan2009
  freopen("/Users/suiyuan2009/CLionProjects/icpc/input.cpp", "r", stdin);
  freopen("/Users/suiyuan2009/CLionProjects/icpc/output.cpp", "w", stdout);
#endif
  int T;
  cin>>T;
  while(T--){
    int x,y,K;
    scan_d(x);
    scan_d(y);
    scan_d(K);
    int tt = K/2;
    ll tmp = cal(tt);
    x = x * tmp % mod;
    y = y * tmp % mod;
    ll rx, ry;
    if(K&1){
      rx = (x + y)%mod;
      ry = (x-y+mod)%mod;
    } else {
      rx = x, ry = y;
    }
    printf("%d %d\n",(int)rx, (int)ry);
  }
  return 0;
}