#include <bits/stdc++.h>
#include <atcoder/all>
using mint = atcoder::static_modint<998244353>;
//using mint = atcoder::static_modint<1000000007>;
using namespace std;
using namespace atcoder;
using ld = long double;
using ll = long long;
#define mp(a,b) make_pair(a,b)
#define rep(i,s,n) for(int i=s; i<n; i++)
const vector<int> dx{1,0,-1,0},dy{0,1,0,-1};

vector<vector<mint>> A;
vector<vector<mint>> arrayproduct(vector<vector<mint>>&X,vector<vector<mint>>&Y){
    int arraysize=X.size();
    vector<vector<mint>> output(arraysize,vector<mint>(arraysize,0));
    rep(i,0,arraysize)rep(j,0,arraysize){
        rep(k,0,arraysize)output[i][j]+=X[i][k]*Y[k][j];
    }
    return output;
}

vector<vector<mint>> arraypower(vector<vector<mint>>&X,ll z){
    if(z==1)return X;
    ll half=z/2;
    auto H=arraypower(X,half);
    auto U=arrayproduct(H,H);
    if(z%2==0)return U;
    else return arrayproduct(U,X);
}
ll x,y;
vector<mint> solve(ll n){
    if(n==1)return {x,y};
    ll h=n/2;
    auto H=solve(h);
    if(n&1){
        auto P=arraypower(A,h+1);
        vector<mint> out(2);
        rep(i,0,2){
            rep(j,0,2){
                out[j]+=P[i][j]*H[i];
                out[j]+=A[i][j]*H[i];
            }
        }
        out[0]+=x;
        out[1]+=y;
        return out;
    }
    else{
        auto P=arraypower(A,h);
        vector<mint> out=H;
        rep(i,0,2){
            rep(j,0,2){
                out[j]+=P[i][j]*H[i];
            }
        }
        return out;
    }
}
int main(){
    cin >> x >> y;
    ll n;cin >> n;

    A={{x,y},{-5*y,x}};
    auto ans=solve(n);
    rep(i,0,2)cout << ans[i].val() << " ";
}