#include <bits/stdc++.h>

#include <atcoder/modint>
using namespace std;
using mint = atcoder::modint;

int main() {
	int n, m;
	cin >> n >> m;
	mint::set_mod(m);

	const int CombMAX = 500;
	std::vector<mint> fac(CombMAX + 1), finv(CombMAX + 1), inv(CombMAX + 1);
	fac[0] = fac[1] = 1;
	finv[0] = finv[1] = 1;
	inv[1] = 1;
	for(int i = 2; i <= CombMAX; i++) {
		fac[i] = fac[i - 1] * i;
		inv[i] = (mint)m - inv[m % i] * (m / i);
		finv[i] = finv[i - 1] * inv[i];
	}

	auto binom = [&](int n, int r) -> mint {
		if(n < r or n < 0 or r < 0) return 0;
		assert(n <= CombMAX);
		return fac[n] * finv[r] * finv[n - r];
	};

	vector dp(n + 1, vector(n, mint(0)));
	dp[0][0] = 1;

	for(int i = 0; i < n; i++) {
		for(int j = 0; j < n; j++) {
			if(dp[i][j] == 0) continue;
			dp[i + 1][j] += dp[i][j];
			for(int k = 2; k <= n - i; k++)
				dp[i + k][j + k - 1] += dp[i][j] * binom(n - i - 1, k - 1) * mint(k).pow(k - 2);
		}
	}

	for(int i = 0; i < n; i++) printf("%d\n", dp.back()[i].val());

	return 0;
}