#include <bits/stdc++.h>

using namespace std;

const long long int MOD = 1e9 + 7;

vector <vector<long long int>> mul(vector <vector<long long int>> a, vector<vector<long long int>> b)
{
    int n = a.size();
    int m = a[0].size();
    int k = b[0].size();
    vector <vector<long long int>>c(n, vector<long long int>(k, 0));

    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < k; j++)
        {
            for (int k = 0; k < m; k++)
            {
                c[i][j] += ((a[i][k] % MOD) * (b[k][j] % MOD) % MOD);
                c[i][j] %= MOD;
            }
        }
    }

    return c;
}

int main(void)
{
	cin.tie(0);
	ios::sync_with_stdio(false);

    vector <vector <long long int>> a(3, vector<long long int>(3,0));
    vector <vector <long long int>> b(3, vector<long long int>(1));
    long long int n, x, y, z;

    cin >> n;
    cin >> x >> y >> z;
    a[0][0] = 1;
    a[0][1] = MOD - 1;
    a[1][1] = 1;
    a[1][2] = MOD - 1;
    a[2][2] = 1;
    a[2][0] = MOD - 1;
    b[0][0] = x;
    b[1][0] = y;
    b[2][0] = z;
   
    n -= 1;
    while (n > 0)
    {
        if (n & 1)
        {
            b = mul(a, b);
        }
        a = mul(a, a);
        n >>= 1;
    }

    cout << b[0][0] << ' ' << b[1][0] << ' ' << b[2][0] << '\n';

	return 0;
}