#include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class T> using vec = vector<T>;
template <class T> using vvec = vector<vec<T>>;

constexpr ll mod = 1e9+7;
struct mint {
    ll x;
    mint(ll x=0):x((x%mod+mod)%mod){}
    
    friend ostream &operator<<(ostream& os,const mint& a){
        return os << a.x;
    }

    friend istream &operator>>(istream& is,mint& a){
        ll t;
        is >> t;
        a = mint(t);
        return (is);
    }

    mint& operator+=(const mint a) {
        if ((x += a.x) >= mod) x -= mod;
        return *this;
    }
    mint& operator-=(const mint a) {
        if ((x += mod-a.x) >= mod) x -= mod;
        return *this;
    }
    mint& operator*=(const mint a) {
        (x *= a.x) %= mod;
        return *this;
    }
    mint operator+(const mint a) const {
        mint res(*this);
        return res+=a;
    }
    mint operator-(const mint a) const {
        mint res(*this);
        return res-=a;
    }
    mint operator*(const mint a) const {
        mint res(*this);
        return res*=a;
    }
    mint pow(ll t) const {
        if (!t) return 1;
        mint a = pow(t>>1);
        a *= a;
        if (t&1) a *= *this;
        return a;
    }
    // for prime mod
    mint inv() const {
        return pow(mod-2);
    }
    mint& operator/=(const mint a) {
        return (*this) *= a.inv();
    }
    mint operator/(const mint a) const {
        mint res(*this);
        return res/=a;
    }
};

using mat = array<array<mint,3>,3>;

mat mult(mat& A,mat& B){
    mat C{};
    for(int i=0;i<3;i++) for(int k=0;k<3;k++) for(int j=0;j<3;j++) C[i][j] += A[i][k]*B[k][j];
    return C;
}


mat pow(mat& A,ll n){
    if(n==1) return A;
    mat R = pow(A,n>>1);
    R = mult(R,R);
    if(n&1) R = mult(R,A);
    return R;
}

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    ll N,A,B,C;
    cin >> N >> A >> B >> C;
    mat M{};
    M[0][0] = M[1][1] = M[2][2] = 1;
    M[0][1] = M[1][2] = M[2][0] = mod-1;
    auto res = pow(M,N-1);
//    for(int i=0;i<3;i++) for(int j=0;j<3;j++) cerr << res[i][j] << (j!=2? " ":"\n");
    cout << res[0][0]*A+res[0][1]*B+res[0][2]*C << " ";
    cout << res[1][0]*A+res[1][1]*B+res[1][2]*C << " ";
    cout << res[2][0]*A+res[2][1]*B+res[2][2]*C << "\n";
}