#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
using ll = long long ;
using P = pair<int,int> ;
using pll = pair<long long,long long>;
constexpr int INF = 1e9;
constexpr long long LINF = 1e17;
constexpr int MOD = 1000000007;
constexpr double PI = 3.14159265358979323846;

using vec = vector<ll> ;
using mat =  vector<vec>;

mat mul(mat &A, mat &B,int mod) {
        mat C(A.size(),vec(B[0].size()));
        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;
                        }
                }
        }
        return C;
}

mat pow(mat A,ll n,int mod){
        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,mod);
                A = mul(A,A,mod);
                n >>= 1;
        }
        return B;
}


int main(){
    ll n;
    cin >> n;
    vector<ll> a(3);
    rep(i,3) cin >> a[i];
    mat A = {{1,MOD-1,0},
             {0,1,MOD-1},
             {MOD-1,0,1}};
    A = pow(A,n-1,MOD);
    vector<ll> ans(3);
    rep(i,3){
        rep(j,3) ans[i] = (ans[i] + (A[i][j]*a[j])%MOD)%MOD;
    }
    rep(i,3) cout << ans[i] << " " ;
    cout << endl;

    return 0;
}