#include<bits/stdc++.h>

typedef long long ll;
typedef std::pair<ll, ll> pii;
const int N = 1e6 + 10;
const int inf = 0x3f3f3f3f;
const int mod = 998244353;
const double eps = 1e-9;

ll qpow(ll x, ll k)//带欧拉降幂
{
    k %= mod - 1;
    x = (x % mod + mod) % mod;
    ll ans = 1;
    while(k)
    {
        if(k & 1) ans = (ans * x) % mod;
        x = (x * x) % mod;
        k >>= 1;
    }
    return ans;
}

int main()
{
#ifdef ONLINE_JUDGE
#else
    freopen("in.txt","r",stdin);
    freopen("out.txt","w",stdout);
#endif
    int t;
    std::cin >> t;
    while(t--)
    {
        ll a, b, n;
        std::cin >> a >> b >> n;
        ll y, x;
        if(n % 2)
        {
            n /= 2;
            y = qpow(2, n) * (a + b) % mod;
            x = qpow(2, n) * (a - b) % mod;
        }
        else
        {
            n /= 2;
            y = qpow(2, n) * a % mod;
            x = qpow(2, n) * b % mod;
        }
        y = (y + mod) % mod;
        x = (x + mod) % mod;
        std::cout << y << ' ' << x << std::endl;
    }
}