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

//* ATCODER
#include<atcoder/all>
using namespace atcoder;
typedef static_modint<10> 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--)

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(){
	int p,q,r; cin>>p>>q>>r;
	ll k; cin >> k;
	k -= 1;
	vector mat(60, vector(3, vector<mint>(3)));
	mat[0][0][0] = 1;
	mat[0][0][1] = 1;
	mat[0][0][2] = 1;
	mat[0][1][0] = 1;
	mat[0][2][1] = 1;
	rep(num,0,59){
		rep(i,0,3){
			rep(j,0,3){
				rep(k,0,3){
					mat[num+1][i][j] += mat[num][i][k] * mat[num][k][j];
				}
			}
		}
	}

	vector<mint> ar = {r, q, p};
	rep(num,0,60){
		if (k >> num & 1){
			vector<mint> nar = {0, 0, 0};
			rep(i,0,3){
				rep(j,0,3){
					nar[i] += mat[num][i][j] * ar[j];
				}
			}
			ar = nar;
		}
	}
	cout << ar[2].val() << '\n';
}