#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define elif else if
#define sp(x) fixed << setprecision(x)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
const ll MOD = 1e9+7;
//const ll MOD = 998244353;
const int inf = (1<<30)-1;
const ll INF = (1LL<<60)-1;
const ld EPS = 1e-10;
template<typename T> bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;};
template<typename T> bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;};

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

mat mat_mul(mat A, mat B){
    int l = sz(A), m = sz(B), n = sz(B[0]);
    mat C(l, vec(n, 0));
    rep(i, l){
        rep(k, m){
            rep(j, n){
                C[i][j] += A[i][k]*B[k][j];
                C[i][j] %= MOD;
            }
        }
    }
    return C;
}

mat mat_pow(mat A, ll k){
    int n = sz(A);
    mat B(n, vec(n, 0));
    rep(i, n) B[i][i] = 1;
    while(k > 0){
        if(k&1) B = mat_mul(B, A);
        A = mat_mul(A, A);
        k >>= 1;
    }
    return B;
}

int main(){
    ll N;
    cin >> N;
    mat A(3, vec(3, 0));
    rep(i, 3){
        A[i][i] = 1;
        A[i][(i+1)%3] = MOD-1;
    }
    A = mat_pow(A, N-1);
    mat x(3, vec(1, 0));
    rep(i, 3) cin >> x[i][0];
    mat ret = mat_mul(A, x);
    rep(i, 3) cout << ret[i][0] << ' ';
    cout << endl;
}