#include <bits/stdc++.h>
using namespace std;
const int mod = 998244353;
int fpow(int x, int u) {
    int y = 1;
    for (; u;u >>= 1,x = 1LL * x * x % mod) if (u & 1) y = 1LL *x * y % mod;
    return y;
}
void solve(){
    int a, b, k;
    cin >> a >> b >> k;
    a = 1LL * a * fpow(2, k / 2) % mod;
    b = 1LL * b * fpow(2, k / 2) % mod;
    if (k & 1) {
        printf("%d %d\n", (a + b) % mod , (a - b + mod) % mod);
    }else{
        printf("%d %d\n", a, b);
    }
}
int main(){
    int T;
    cin >> T;
    while (T--) solve();
}