#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")

////////////////////////////////////////////////////////////////////////////////
// Barrett
struct ModInt {
  static unsigned M;
  static unsigned long long NEG_INV_M;
  static void setM(unsigned m) { M = m; NEG_INV_M = -1ULL / M; }
  unsigned x;
  ModInt() : x(0U) {}
  ModInt(unsigned x_) : x(x_ % M) {}
  ModInt(unsigned long long x_) : x(x_ % M) {}
  ModInt(int x_) : x(((x_ %= static_cast<int>(M)) < 0) ? (x_ + static_cast<int>(M)) : x_) {}
  ModInt(long long x_) : x(((x_ %= static_cast<long long>(M)) < 0) ? (x_ + static_cast<long long>(M)) : x_) {}
  ModInt &operator+=(const ModInt &a) { x = ((x += a.x) >= M) ? (x - M) : x; return *this; }
  ModInt &operator-=(const ModInt &a) { x = ((x -= a.x) >= M) ? (x + M) : x; return *this; }
  ModInt &operator*=(const ModInt &a) {
    const unsigned long long y = static_cast<unsigned long long>(x) * a.x;
    const unsigned long long q = static_cast<unsigned long long>((static_cast<unsigned __int128>(NEG_INV_M) * y) >> 64);
    const unsigned long long r = y - M * q;
    x = r - M * (r >= M);
    return *this;
  }
  ModInt &operator/=(const ModInt &a) { return (*this *= a.inv()); }
  ModInt pow(long long e) const {
    if (e < 0) return inv().pow(-e);
    ModInt a = *this, b = 1U; for (; e; e >>= 1) { if (e & 1) b *= a; a *= a; } return b;
  }
  ModInt inv() const {
    unsigned a = M, b = x; int y = 0, z = 1;
    for (; b; ) { const unsigned q = a / b; const unsigned c = a - q * b; a = b; b = c; const int w = y - static_cast<int>(q) * z; y = z; z = w; }
    assert(a == 1U); return ModInt(y);
  }
  ModInt operator+() const { return *this; }
  ModInt operator-() const { ModInt a; a.x = x ? (M - x) : 0U; return a; }
  ModInt operator+(const ModInt &a) const { return (ModInt(*this) += a); }
  ModInt operator-(const ModInt &a) const { return (ModInt(*this) -= a); }
  ModInt operator*(const ModInt &a) const { return (ModInt(*this) *= a); }
  ModInt operator/(const ModInt &a) const { return (ModInt(*this) /= a); }
  template <class T> friend ModInt operator+(T a, const ModInt &b) { return (ModInt(a) += b); }
  template <class T> friend ModInt operator-(T a, const ModInt &b) { return (ModInt(a) -= b); }
  template <class T> friend ModInt operator*(T a, const ModInt &b) { return (ModInt(a) *= b); }
  template <class T> friend ModInt operator/(T a, const ModInt &b) { return (ModInt(a) /= b); }
  explicit operator bool() const { return x; }
  bool operator==(const ModInt &a) const { return (x == a.x); }
  bool operator!=(const ModInt &a) const { return (x != a.x); }
  friend std::ostream &operator<<(std::ostream &os, const ModInt &a) { return os << a.x; }
};
unsigned ModInt::M;
unsigned long long ModInt::NEG_INV_M;
// !!!Use ModInt::setM!!!
////////////////////////////////////////////////////////////////////////////////

using Mint = ModInt;

constexpr int LIM_INV = 1010;
Mint inv[LIM_INV], fac[LIM_INV], invFac[LIM_INV];

void prepare() {
  inv[1] = 1;
  for (int i = 2; i < LIM_INV; ++i) {
    inv[i] = -((Mint::M / i) * inv[Mint::M % i]);
  }
  fac[0] = invFac[0] = 1;
  for (int i = 1; i < LIM_INV; ++i) {
    fac[i] = fac[i - 1] * i;
    invFac[i] = invFac[i - 1] * inv[i];
  }
}
Mint binom(Int n, Int k) {
  if (n < 0) {
    if (k >= 0) {
      return ((k & 1) ? -1 : +1) * binom(-n + k - 1, k);
    } else if (n - k >= 0) {
      return (((n - k) & 1) ? -1 : +1) * binom(-k - 1, n - k);
    } else {
      return 0;
    }
  } else {
    if (0 <= k && k <= n) {
      assert(n < LIM_INV);
      return fac[n] * invFac[k] * invFac[n - k];
    } else {
      return 0;
    }
  }
}


int N;
Mint Q;
int MO;

Mint ans[110];

Mint forest[110][110];
Mint S2[110][110];

/*
  each part: isomorphic subtrees
  ps: incr.
  in-tree: large part to small part
  parts of same size: ban cycle
*/
int ps[110];
void check(int sum, int len) {
// cerr<<"[check] "<<1+sum<<"; ";pv(ps,ps+len);
  Mint pie = Q.pow(1 + len);
  Mint lab = fac[sum];
  Mint way = 1;
  for (int i = 0; i < len; ++i) {
    Mint here = 0;
    for (int k = ps[i]; --k >= 0; ) {
// cerr<<"    HELP "<<ps[i]<<" "<<k<<": "<<(((k&1)?-1:+1) * fac[k] * S2[ps[i]][k + 1])<<endl;
      (here *= Q) += ((k&1)?-1:+1) * fac[k] * S2[ps[i]][k + 1];
    }
    pie *= here;
  }
  for (int i = 0, j = 0; i < len; i = j) {
    for (; j < len && ps[i] == ps[j]; ++j) {}
    lab *= invFac[ps[i]].pow(j - i);
    lab *= invFac[j - i];
    const int n = ps[i] * (j - i);
    // root
    vector<Mint> crt(n + 1, 1);
    for (int k = 0; k < i; ++k) {
      auto nxt = crt;
      for (int m = 0; m <= n; ++m) {
        for (int l = 1; ps[k] * l <= m; ++l) {
          nxt[m] += crt[m - ps[k] * l] * fac[m] * invFac[m - ps[k] * l] * invFac[l].pow(ps[k]);
        }
      }
      crt.swap(nxt);
    }
    Mint here = 0;
    for (int k = 1; k <= j - i; ++k) {
      here += fac[ps[i]].pow((j - i) - k) * forest[j - i][k] * crt[ps[i] * k];
    }
    way *= here;
  }
// cerr<<"  pie = "<<pie<<", lab = "<<lab<<", way = "<<way<<endl;
  ans[1 + sum] += pie * lab * way;
}

void dfs(int pos, int limSum, int sum, int last) {
  check(sum, pos);
  for (int &p = ps[pos] = last; sum + p <= limSum; ++p) {
    dfs(pos + 1, limSum, sum + p, p);
  }
}

int main() {
  for (; ~scanf("%d%u%d", &N, &Q.x, &MO); ) {
    Mint::setM(MO);
    prepare();
    
    for (int n = 1; n <= N; ++n) {
      for (int k = 1; k <= n; ++k) {
        forest[n][k] = binom(n - 1, k - 1) * Mint(n).pow(n - k);
      }
// cerr<<"forest["<<n<<"] = ";pv(forest[n],forest[n]+n+1);
    }
    for (int n = 0; n <= N; ++n) {
      S2[n][0] = 0;
      S2[n][n] = 1;
      for (int k = 1; k < n; ++k) {
        S2[n][k] = S2[n - 1][k - 1] + k * S2[n - 1][k];
      }
    }
    
    memset(ans, 0, sizeof(ans));
    dfs(0, min(N - 1, 40), 0, 1);
    
    for (int n = 1; n <= N; ++n) {
      printf("%u\n", ans[n].x);
    }
  }
  return 0;
}