/**
	author:  shobonvip
	created: 2025.01.17 21:47:55
**/

#include<bits/stdc++.h>
using namespace std;

//* ATCODER
#include<atcoder/all>
using namespace atcoder;
typedef modint998244353 mint;
//*/

/* BOOST MULTIPRECISION
#include<boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
//*/

typedef long long ll;

#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--)
#define all(v) v.begin(), v.end()

template <typename T> bool chmin(T &a, const T &b) {
	if (a <= b) return false;
	a = b;
	return true;
}

template <typename T> bool chmax(T &a, const T &b) {
	if (a >= b) return false;
	a = b;
	return true;
}

template <typename T> T max(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]);
	return ret;
}

template <typename T> T min(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]);
	return ret;
}

template <typename T> T sum(vector<T> &a){
	T ret = 0;
	for (int i=0; i<(int)a.size(); i++) ret += a[i];
	return ret;
}

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	
	ll a, b; cin >> a >> b;
	ll n; cin >> n;
	vector mat(60, vector(4, vector<mint>(4)));
	mat[0][0][0] = a;
	mat[0][0][1] = -5*b;
	mat[0][1][0] = b;
	mat[0][1][1] = a;
	mat[0][2][0] = 1;
	mat[0][2][2] = 1;
	mat[0][3][1] = 1;
	mat[0][3][3] = 1;
	rep(num,0,59){
		rep(i,0,4){
			rep(j,0,4){
				rep(k,0,4){
					mat[num+1][i][j] += mat[num][i][k] * mat[num][k][j];
				}
			}
		}
	}
	
	vector<mint> var = {a, b, 0, 0};
	rep(num,0,60) {
		if (n >> num & 1) {
			vector<mint> nvar(4);
			rep(i,0,4){
				rep(j,0,4){
					nvar[i] += mat[num][i][j] * var[j];
				}
			}
			swap(nvar, var);
		}
	}
	cout << var[2].val() << ' ' << var[3].val() << endl;


}