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

#define int long long
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }

#define MOD 1000000007

typedef vector<int> vec;
typedef vector<vec> mat;

mat mul(mat a, mat b){
	mat c(a.size(), vec(b[0].size(), 0));
	for(int i = 0;i < a.size();i++){
		for(int k = 0;k < b.size();k++){
			for(int j = 0;j < b[0].size();j++){
				c[i][j] = (c[i][j] + a[i][k]*b[k][j]%MOD) % MOD;
			}
		}
	}
	return c;
}

mat pow_mat(mat a, int n){
	mat b(a.size(), vec(a.size()));
	for(int i = 0;i < a.size();i++){
		b[i][i] = 1;
	}

	while(n > 0){
		if(n & 1) b = mul(b, a);
		a = mul(a, a);
		n >>= 1;
	}
	return b;
}

signed main(){
	int n;
	cin >> n;
	int a, b, c;
	cin >> a >> b >> c;
	mat x(3, vec(3, 0));


	x[0][0] = x[1][1] = x[2][2] = 1;
	x[0][1] = x[1][2] = x[2][0] = MOD-1;

	x = pow_mat(x, n-1);

	int ans[3]= {
		(x[0][0] * a % MOD + x[0][1]*b % MOD + x[0][2]*c % MOD) % MOD,
		(x[1][0] * a % MOD + x[1][1]*b % MOD + x[1][2]*c % MOD) % MOD,
		(x[2][0] * a % MOD + x[2][1]*b % MOD + x[2][2]*c % MOD) % MOD
	};
	cout << ans[0] << " " << ans[1] << " " << ans[2] << endl;
	return 0;
}