#include <bits/stdc++.h>
using namespace std;
long long MOD = 1000000007;
vector<vector<long long>> matrix_multiplication(vector<vector<long long>> &A, vector<vector<long long>> &B){
  int N = A.size();
  int M = B.size();
  int K = B[0].size();
  vector<vector<long long>> ans(N, vector<long long>(K, 0));
  for (int i = 0; i < N; i++){
    for (int j = 0; j < M; j++){
      for (int k = 0; k < K; k++){
        ans[i][k] += A[i][j] * B[j][k];
        ans[i][k] %= MOD;
      }
    }
  }
  return ans;
}
vector<vector<long long>> matrix_exponentiation(vector<vector<long long>> A, long long M){
  int N = A.size();
  vector<vector<long long>> ans(N, vector<long long>(N, 0));
  for (int i = 0; i < N; i++){
    ans[i][i] = 1;
  }
  while (M > 0){
    if (M % 2 == 1){
      ans = matrix_multiplication(ans, A);
    }
    A = matrix_multiplication(A, A);
    M /= 2;
  }
  return ans;
}
int main(){
  long long N;
  cin >> N;
  long long A, B, C;
  cin >> A >> B >> C;
  vector<vector<long long>> M = {{1, MOD - 1, 0}, {0, 1, MOD - 1}, {MOD - 1, 0, 1}};
  M = matrix_exponentiation(M, N - 1);
  vector<vector<long long>> F = {{A}, {B}, {C}};
  vector<vector<long long>> ans = matrix_multiplication(M, F);
  cout << ans[0][0] << ' ' << ans[1][0] << ' ' << ans[2][0] << endl;
}