#include <iostream>

 #include <cstdio>

 #include <cstring>

 using namespace std;

 const int maxn =  + ;

 typedef long long Vector[maxn];

 int n, m, d, k;

 inline int value(Vector A, int i, int j)

 {//循环矩阵A(i, j)的值

     return A[(((j-i)%n)+n)%n];

 }

 void matrix_mul(Vector A, Vector B, Vector res)

 {

     Vector C;

     memset(C, , sizeof(C));

     for(int j = ; j < n; j++)

         for(int k = ; k < n; k++)

             C[j] = (C[j] + A[k] * value(B, k, j)) % m;

     memcpy(res, C, sizeof(C));

 }

 void matrix_pow(Vector A, int n, Vector res)

 {

     Vector a, r;

     memcpy(a, A, sizeof(a));

     memset(r, , sizeof(r));

     r[] = ;

     while(n)

     {

         if(n&) matrix_mul(r, a, r);

         n >>= ;

         matrix_mul(a, a, a);

     }

     memcpy(res, r, sizeof(r));

 }

 void solve(Vector A, Vector v, Vector res)

 {

     Vector B;

     memset(B, , sizeof(B));

     for(int i = ; i < n; i++)

         for(int j = ; j < n; j++)

             B[i] = (B[i] + value(A, i, j) * v[j]) % m;

     memcpy(res, B, sizeof(B));

 }

 int main()

 {

     //freopen("in.txt", "r", stdin);

     while(cin >> n >> m >> d >> k)

     {

         Vector A, v;

         for(int i = ; i < n; i++) cin >> v[i];

         memset(A, , sizeof(A));

         for(int p = -d; p <= d; p++)

         {

             int x = ((p%n)+n)%n;

             A[x] = ;

         }

         /*for(int i = 0; i < n; i++)

         {

             for(int j = 0; j < n; j++)

                 printf("%d ", value(A, i, j));

             printf("\n");

         }*/

         matrix_pow(A, k, A);

         solve(A, v, v);

         for(int i = ; i < n; i++)

         {

             if(i) printf(" ");

             cout << v[i];

         }

         printf("\n");

     }

     return ;

 }