//wtrl,everybody hangbeat me
#include<bits/stdc++.h>
/*#include<iostream>
#include<string>
#include<cmath>
#include<cstdio>
#include<cctype>
#include<cstring>
#include<iomanip>
#include<cstdlib>
#include<ctime>
#include<set>
#include<map>
#include<utility>
#include<queue>
#include<vector>
#include<stack>
#include<sstream>
#include<algorithm>*/
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<pii> vii;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vi> vvi;
typedef pair<ll,ll> pll;
/*=====================================================================*/
#define pb push_back
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define all(s) (s).begin(),(s).end()
#define repd(i,n) for(int i=n-1;i>=0;i--)
#define forn(i,p,n) for(int i=p;i<=n;i++)
#define ford(i,p,n) for(int i=n;i>=p;i--)
#define foreach(i,c) for(__typeof(c.begin())i=(c.begin());i!=(c).end();++i)
#define INF 1e9
#define PI acos(-1)
/*=====================================================================*/
string int_to_string(ll n)
{
    string s="";
    while(n)
    {
        ll now=n%10;
        s+=now+'0';
        n/=10;
    }
    reverse(s.begin(),s.end());
    return s;
}
ll string_to_int(string s)
{
    ll n=0;
    rep(i,s.size())
    {
        n*=10;
        n+=s[i]-'0';
    }
    return n;
}
/*======================================================================*/
const int dx[]={-1,0,1,0};
const int dy[]={0,-1,0,1};
const int month[2][12]={{31,28,31,30,31,30,31,31,30,31,30,31},{31,29,31,30,31,30,31,31,30,31,30,31}};
//think twice,code once
//think once,debug forever
int mod=998244353;
ll quickpower(ll n,ll k)
{
    //cout<<n<<" "<<k<<" "; 
    ll now=1;
    while(k)
    {
        if(k&1)
        {
            now*=n;
            now%=mod;
        }
        n*=n;
        n%=mod;
        k>>=1;
    }
    //cout<<now<<endl;
    return now;
} 
void solve()
{
    ll a,b,k;
    cin>>a>>b>>k;
    if(k%2==1)
    {
        //cout<<quickpower(2,k/2)<<" "<<a<<" "<<(quickpower(2,k/2)*a)<<endl; 
        a=(quickpower(2,k/2)*a)%mod,b=(quickpower(2,k/2)*b)%mod;
        //cout<<a<<" "<<b<<endl;
        cout<<(a+b)%mod<<" "<<(a+mod-b)%mod<<endl;
    }
    else
    {
        a=(quickpower(2,k/2)*a)%mod,b=(quickpower(2,k/2)*b)%mod;
        cout<<a<<" "<<b<<endl;    
    }
}
/*======================================================================*/
signed main()
{
    std::ios::sync_with_stdio(false);
  /*
    freopen("input.txt","r",stdin);
    freopen("output.txt","w",stdout);
  */
  /*====================================================================*/
  int t=1;
  cin>>t;
  while(t--)
  {
      solve();
  }
  return 0;
}
/*
注意数组越界，vector长度为0的时候循环会RE
注意输入顺序
注意循环时int*int爆ll
注意答案存爆ll
存答案用string过慢，最好直接输出或者用vector<char>
memset是O(n)
*/