#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;
using mint = modint;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n;
  ll m;
  int p;
  cin >> n >> m >> p;
  mint::set_mod(p);
  vector<mint> ak(n), a(n);
  rep(i, n) {
    ll x;
    cin >> x;
    a[i] = x;
  }
  auto mul = [n](const vector<mint>& a, const vector<mint>& b) {
    vector<mint> c(n), ab(n);
    rep(i, n) c[i] = a[i] + b[i];
    rep(i, n) rep(j, n - i) ab[i+j] += a[i] * b[j];
    rep(i, n) rep(j, n - i - 2) c[i+j+2] += c[i] * ab[j];
    return c;
  };
  while (m) {
    if (m & 1) ak = mul(ak, a);
    a = mul(a, a);
    m >>= 1;
  }
  rep(i, n) cout << ak[i].val() << " \n"[i + 1 == n];
}