#include <bits/stdc++.h>
#define ull unsigned long long
using namespace std;
const int N = 25;
const int M = 19;

mt19937_64 rnd(chrono :: steady_clock :: now().time_since_epoch().count());
ull base;
struct fastmod {
  typedef unsigned long long u64;
  typedef __uint128_t u128;

  int m;
  u64 b;

  fastmod(int m) : m(m), b(((u128)1 << 64) / m) {}
  int reduce(u64 a) {
    u64 q = ((u128)a * b) >> 64;
    int r = a - q * m;
    return r < m ? r : r - m;
  }
} z(2);
inline void Add(int &x, int y) {x = z.reduce(x + y);}

struct node {
	int sz; ull id;
	vector<int> g;
};
node tmp;
vector<node> vec;
int n, q, mod, fac[N], inv[N], pw[N], ans[N], NOW;
vector<int> now;
int num[N][N];

inline int qpow(int x, int y) {
	int res = 1;
	while (y) {
		if (y & 1) res = z.reduce(1ll * res * x);
		x = z.reduce(1ll * x * x);
		y >>= 1;
	}
	return res;
}

ull calc(ull x) {return (((x * x * x) % base) + x * 6) ^ (x * base);}
ull f(ull x) {return (calc(x >> 23) + calc(x << 34)) ^ calc(x << 7);}

void insert(int sz) {
	tmp.sz = sz;
	tmp.g.clear(); tmp.id = 1;
	for (auto y : now) {
		tmp.g.push_back(y);
		tmp.id += f(vec[y].id);
	}
	vec.push_back(tmp);
}

void dfs(int st, int sz) {
	if (sz == NOW - 1) insert(sz + 1);
	for (int i = st; i < vec.size(); ++i) {
		if (sz + vec[i].sz >= NOW) break;
		now.push_back(i);
		dfs(i, sz + vec[i].sz);
		now.pop_back();
	}
}

int val;
set<ull> S;

void dfs2(int x) {
	for (int i = 0; i < vec[x].g.size(); ++i) {
		int j = i;
		while (j + 1 < vec[x].g.size() && vec[x].g[j] == vec[x].g[j + 1]) j++;
		val = z.reduce(1ll * val * inv[j - i + 1]);
		i = j;
		dfs2(vec[x].g[i]);
	}
	S.insert(vec[x].id);
}

void work(int id) {
	S.clear();
	val = fac[vec[id].sz - 1];
	dfs2(id);
	Add(ans[vec[id].sz], z.reduce(1ll * val * pw[S.size()]));
}

int main() {
//	freopen("B.in", "r", stdin);
	base = rnd();
	scanf("%d%d%d", &n, &q, &mod);
	z = fastmod(mod);
	fac[0] = 1;
	for (int i = 1; i <= M; ++i) fac[i] = z.reduce(1ll * fac[i - 1] * i);
	inv[M] = qpow(fac[M], mod - 2);
	for (int i = M; i >= 1; --i) inv[i - 1] = z.reduce(1ll * inv[i] * i);
	pw[0] = 1;
	for (int i = 1; i <= M; ++i) pw[i] = z.reduce(1ll * pw[i - 1] * q);
	for (int i = 1; i <= M; ++i) NOW = i, dfs(0, 0);
	for (int i = 0; i < vec.size(); ++i) work(i);
	for (int i = 1; i <= n; ++i) {
		if (i <= M) printf("%d\n", ans[i]);
		else puts("0");
	}
	return 0;
}