#include<bits/stdc++.h>
using namespace std;
long long quickMod(long long a, long long b, long long c)
{
    long long ans = 1;
    while (b)
    {
 
        if (b % 2 == 1)
            ans = (ans * a) % c;
        b /= 2;
        a = (a * a) % c;
    }
    return ans;
}
int main()
{
    int t,a,b,k;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d%d%d",&a,&b,&k);
        long long x=quickMod(2,(long long)k/2,998244353);
        long long x1=(x*(long long)a)%998244353;
        long long x2=(x*(long long)b)%998244353;
        //printf("%d %d ",x,x2); 
        if(k%2==0)
        {
            printf("%d %d\n",(int)x1,(int)x2); 
        }
        else
        {
            long long y1=(x1+x2)%998244353;
            long long y2=(x1-x2+998244353)%998244353;
            printf("%d %d\n",(int)y1,(int)y2); 
        }
    } 
}