#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("Yes");}else{puts("No");}
#define MAX_N 200005

const ll MOD = 1000000007;

// DPの更新
vector<ll> matmul(vector<ll> &dp, vector<vector<ll>> &mt, int m){
    vector<ll> ret(m,0);
    rep(i,m){
        rep(j,m){
            ret[i] += mt[i][j] * dp[j] % MOD;
            ret[i] %= MOD;
        }
    }
    return ret;
}
// 遷移行列の更新
vector<vector<ll>> update_matmul(vector<vector<ll>> &mt, int m){
    vector<vector<ll>> ret(m, vector<ll>(m,0));
    rep(i,m){
        rep(j,m){
            rep(k,m){
                ret[i][j] += mt[i][k] * mt[k][j] % MOD;
                ret[i][j] %= MOD;
            }
        }
    }
    return ret;
}

void matpow(vector<ll> &dp, vector<vector<ll>> &mt, int m, ll k){
    while(k){
        if(k & 1) dp = matmul(dp, mt, m);
        mt = update_matmul(mt, m);
        k /= 2;
    }
}


int main() {
    ll n,a,b,c;
    cin >> n >> a >> b >> c;
    ll m, K;
    m = 4;
    K = n-1;

    vector<ll> dp(m);
    dp[0] = a;
    dp[1] = b;
    dp[2] = c;
    dp[3] = MOD;
    vector<vector<ll>> mt(m,vector<ll>(m));
    rep(i,m)rep(j,m)mt[i][j] = 0;

    mt[0][0] = 1; mt[0][1] = -1;
    mt[1][1] = 1; mt[1][2] = -1;
    mt[2][2] = 1; mt[2][0] = -1;
    rep(i,4)mt[i][3] = 1;
    
    matpow(dp, mt, m, K);
    rep(i,3){
        dp[i] += MOD * 100;
        dp[i] %= MOD;
    }
    cout << dp[0] << ' ' << dp[1] << ' ' << dp[2] << endl;
    return 0;
}