#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
#define Rep(i,a,b) for(register int i=(a);i<=int(b);++i)
#define Dep(i,a,b) for(register int i=(a);i>=int(b);--i)
#define rep(i,a,b) for(register int i=(a);i<int(b);++i)
#define mem(x,v) memset(x,v,sizeof(x))
#define fi first
#define se second
#define lowbit(x) ((x)&-(x))
#define debug(x) cout << #x " = " << x << endl;
namespace IO{
    const int L = 1 << 15;
    char c,st[66];int tp=0,f;
    #define gc getchar
    #define pc putchar
    inline ll read(){
        ll x=0;f=1,c=gc();
        for(;!isdigit(c);c=gc())if(c=='-')f=-1;
        for(;isdigit(c);c=gc())x=(x<<1)+(x<<3)+(c&15);
        return x*f;
    }
    void write(ll x){
        if(!x) pc('0');if(x<0) pc('-'),x=-x;
        while(x) st[++tp]=x%10+'0',x/=10;
        while(tp) pc(st[tp--]);
    }
    void wri(ll x){write(x);pc(' ');}
    void writeln(ll x){write(x);pc('\n');}
}
using IO::read;
using IO::writeln;
using IO::write;
using IO::wri;
inline void gg(string s){cout << s << endl;exit(0);}
inline void gg(ll x){writeln(x);exit(0);}
const int mod = 998244353;
inline int qpow(int a,int b){
    int ans=1;
    for(;b;b>>=1,a=1ll*a*a%mod)
        if(b&1) ans=1ll*ans*a%mod;
    return ans;
}
int main(){
    int T = read();
    while(T--){
        int A,B;
        int a = read(),b = read(),k = read();
        if(k&1){
            A=(a+b)%mod,B=(a-b+mod)%mod,k--;
        } else A=a,B=b;
        k/=2;
        A=1ll*A*qpow(2,k)%mod;
        B=1ll*B*qpow(2,k)%mod;
        wri(A),writeln(B);
    }
}