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

int mod = 1000000007;

vector<vector<long long>> Mul(vector<vector<long long>> A,vector<vector<long long>> B) {
    vector<vector<long long>>ans(A.size(),vector<long long>(A.size()));
    for(int i = 0; i < A.size(); i++) {
        for(int j = 0; j < A.size(); j++) {
            for(int k = 0; k < A.size(); k++) {
                ans[i][j] += A[i][k]*B[k][j]%mod;
                ans[i][j] %= mod;
            }
        }
    }
    return ans;
}

vector<vector<long long>> Pow(vector<vector<long long>> A,long long B) {
    vector<vector<long long>>ans(A.size(),vector<long long>(A.size()));
    for(int i = 0; i < A.size(); i++) {
        ans[i][i] = 1;
    }
    while (B) {
        if(1 & B) {
            ans = Mul(ans,A);
        }
        A = Mul(A,A);
        B /= 2;
    }
    return ans;
}

int main() {
    long long N;
    int A,B,C;
    cin >> N >> A >> B >> C;
    vector<vector<long long>>tmp(3,vector<long long>(3));
    tmp[0][0] = 1;
    tmp[0][1] = 1000000006;
    tmp[1][1] = 1;
    tmp[1][2] = 1000000006;
    tmp[2][2] = 1;
    tmp[2][0] = 1000000006;
    tmp = Pow(tmp,N-1);
    long long a = 0,b = 0,c = 0;
    a += tmp[0][0]*A%mod;
    b += tmp[1][0]*A%mod;
    c += tmp[2][0]*A%mod;
    a %= mod;
    b %= mod;
    c %= mod;
    a += tmp[0][1]*B%mod;
    b += tmp[1][1]*B%mod;
    c += tmp[2][1]*B%mod;
    a %= mod;
    b %= mod;
    c %= mod;
    a += tmp[0][2]*C%mod;
    b += tmp[1][2]*C%mod;
    c += tmp[2][2]*C%mod;
    a %= mod;
    b %= mod;
    c %= mod;
    cout << a << " " << b << " " << c << endl;
}