#include <bits/stdc++.h>
#define db double
#define il inline
#define re register
#define ll long long
#define ui unsigned
#define ull ui ll
#define i128 __int128
#define pii pair<int, int>
#define fi first
#define se second
#define eb emplace_back
#define SZ(v) (int)v.size()
#define ALL(v) v.begin(), v.end()
#define mems(v, x) memset(v, x, sizeof(v))
#define memc(a, b) memcpy(a, b, sizeof(a))
#define FOR(i, L, R) for(re int i = (L); i <= (R); ++i)
#define ROF(i, R, L) for(re int i = (R); i >= (L); --i)
#define LS i << 1, l, mid
#define RS i << 1 | 1, mid + 1, r
#define popc(x) __builtin_popcount(x)
using namespace std;
#define N 1000005
int P;
il int add(int x, int y) {return x + y < P ? x + y : x + y - P;}
il void addr(int &x, int y) {(x += y) >= P && (x -= P);}
il int qpow(int p, int n = P - 2) {
  int s = 1;
  while(n) {
    if(n & 1) s = 1ll * s * p % P;
    p = 1ll * p * p % P, n >>= 1;
  }
  return s;
}
int n, w;
il vector<int> ntt(vector<int> f, int w) {
  if(SZ(f) <= 3) {
    int c = 1; vector<int> s(SZ(f));
    for(auto &sum : s) {
      int v = 1;
      for(auto x : f)
        addr(sum, 1ll * v * x % P),
        v = 1ll * v * c % P;
      c = 1ll * c * w % P;
    }
    assert(c == 1);
    return s;
  }
  int m = SZ(f) / 2; vector<int> a(m), b(m);
  FOR(i, 0, m - 1) a[i] = f[i * 2], b[i] = f[i * 2 + 1];
  int c = 1, p = 1ll * w * w % P, op = qpow(w, m);
  a = ntt(a, p), b = ntt(b, p);
  FOR(i, 0, m - 1) {
    f[i] = add(a[i], 1ll * b[i] * c % P);
    f[i + m] = add(a[i], 1ll * op * b[i] % P * c % P);
    c = 1ll * c * w % P;
  }
  return f;
}
il void WORK() {
  // cerr << n << "\n";
  vector<int> f(n);
  for(auto &x : f) cin >> x; f = ntt(f, w);
  for(auto x : f) cout << x << " "; cout << "\n";
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0), cout.tie(0);
  while(cin >> n >> P >> w) WORK();
  cerr << 1.0 * clock() / CLOCKS_PER_SEC;
  return 0;
}