#include<cstdio>
long long m[5][5];
long long b[5][5];
long long c[5][5];
long long a[5];
const long long mod = 1e9+7;

void mul(long long x[5][5],long long y[5][5],int n){
    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= n; j++){
            b[i][j] = 0;
            for(int k = 1; k <= n; k++){
                b[i][j] = (b[i][j]+x[i][k]*y[k][j]%mod)%mod;
                if(b[i][j]<0) b[i][j] += mod;
            }
        }
    }
    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= n; j++) x[i][j] = b[i][j];
    }
}

void quickMul(int n,long long b){
    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= n; j++){ 
            c[i][j] = m[i][j];
            if(i==j) m[i][j] = 1;
            else m[i][j] = 0;
        }
    }
    while(b){
        if(b&1) mul(m,c,n);
        mul(c,c,n);
        b /= 2;
    }
}

int main(){
    m[1][1] = 1, m[1][2] = -1;
    m[2][2] = 1, m[2][3] = -1;
    m[3][3] = 1, m[3][1] = -1;
    long long n;
    scanf("%lld",&n);
    n--;
    for(int i = 1; i <= 3; i++) scanf("%lld",&a[i]);
    quickMul(3,n);
    for(int i = 1; i <= 3; i++){
        long long cur = 0;
        for(int j = 1; j <= 3; j++) cur = (cur+m[i][j]*a[j]%mod)%mod;
        if(cur<0) cur += mod;
        printf("%lld ",cur);
    }
    printf("\n");
    return 0;
}