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

#define REP(i,m,n) for(int i=(m); i<(int)(n); i++)
#define RREP(i,m,n) for(int i=(int)(n-1); i>=m; i--)
#define rep(i,n) REP(i,0,n)
#define rrep(i,n) RREP(i,0,n)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define fi first
#define se second
#define debug(...) {cerr<<"[L"<<__LINE__<<"] "; _debug(__VA_ARGS__);}

template<typename T>
string join(const vector<T>&v, string del=", "){ stringstream s;
    for(auto x : v) s << del << x; return s.str().substr(del.size());
}
template<typename T>
ostream& operator<<(ostream& o, const vector<T>&v){
    if(v.size()) o << "[" << join(v) << "]"; return o;
}
template<typename T>
ostream& operator<<(ostream& o, const vector<vector<T> >&vv){
    int l = vv.size();
    if(l){ o<<endl; rep(i,l) o << (i==0 ? "[ " : ",\n  " ) << vv[i] << (i==l-1 ? " ]" : ""); }
    return o;
}
inline void _debug(){cerr<<endl;}
template<class First, class... Rest>
void _debug(const First& first, const Rest&... rest){cerr<<first<<" ";_debug(rest...);}

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;

const double PI = (1*acos(0.0));
const double EPS = 1e-9;
const int INF = 0x3f3f3f3f;
const ll INFL = 0x3f3f3f3f3f3f3f3fLL;
const ll mod = 1e9 + 7;

inline void finput(string filename) {
    freopen(filename.c_str(), "r", stdin);
}

struct mint {
    long long x;
    mint(long long x=0) : x((x%mod+mod)%mod) {}
    mint operator-() const {
      return mint(-x);
    }
    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;
    }
    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;
    }
    friend ostream& operator<<(ostream& os, const mint& m){
        os << m.x; return os;
    }
};

template<typename T>
struct Mat{
    int h, w;
    vector<vector<T>> m, _m;
    Mat(int h, int w): h(h), w(w), m(h, vector<T>(w)){}
    inline T& at(int i, int j) { return m[i][j]; }
    inline const T& at(int i, int j) const { return m[i][j]; }
    static Mat<T> identity(int n){
        Mat<T> A(n, n);
        rep(i,n) A.at(i,i) = 1;
        return A;
    }
    inline static Mat<T> identity(const Mat<T> &A) { return identity(A.h); }
    Mat<T>& operator+=(const Mat& B) {
        rep(i,h) rep(j,w){
            at(i,j) += B.at(i,j);
        }
        return *this;
    }
    Mat<T>& operator-=(const Mat& B) {
        rep(i,h) rep(j,w){
            at(i,j) -= B.at(i,j);
        }
        return *this;
    }
    Mat<T>& operator*=(const Mat& B) {
        assert(w == B.h);
        _m.assign(h, vector<T>(B.w, 0));
        rep(i,h) rep(j,B.w){
            T tmp = 0;
            rep(k,w) tmp += at(i,k) * B.at(k,j);
            _m[i][j] = tmp;
        }
        swap(m, _m);
        return *this;
    }
    Mat<T> pow(ll n) {
        Mat<T> A = identity(h);
        Mat<T> B = *this;
        while(n > 0){
            if(n & 1) A *= B;
            B *= B;
            n >>= 1;
        }
        return A;
    }
};

int main(){
    ios_base::sync_with_stdio(0);
    // finput("./input");
    ll n; cin >> n;
    ll a,b,c; cin >> a >> b >> c;
    Mat<mint> m(3, 3);
    m.at(0, 0) = 1; m.at(0, 1) = -1; m.at(0, 2) = 0;
    m.at(1, 0) = 0; m.at(1, 1) = 1; m.at(1, 2) = -1;
    m.at(2, 0) = -1; m.at(2, 1) = 0; m.at(2, 2) = 1;
    m = m.pow(n-1);
    Mat<mint> abc(3, 1);
    abc.at(0, 0) = a;
    abc.at(1, 0) = b;
    abc.at(2, 0) = c;
    m *= abc;
    printf("%ld %ld %ld\n", m.at(0, 0).x, m.at(1, 0).x, m.at(2, 0).x);
    return 0;
}