#include <bits/stdc++.h>
using namespace std;

int md;

inline int add(int x, int y) {
	if (x + y >= md) return x + y - md;
	return x + y;
}

inline int sub(int x, int y) {
	if (x < y) return x - y + md;
	return x - y;
}

struct FastMod {
	unsigned long long b, m;
	FastMod() {}
	FastMod(unsigned long long b) : b(b), m((unsigned long long)((__uint128_t(1) << 64) / b)) {}
	unsigned long long operator()(unsigned long long a) {
		unsigned long long q = (unsigned long long)((__uint128_t(m) * a) >> 64);
		unsigned long long r = a - q * b; // can be proven that 0 <= r < 2*b
		return r >= b ? r - b : r;
	}
} M;

inline int mul(int x, int y) {
	return M(1ull * x * y);
}

const int N = 205;

int dp[N * 2][N][N], ans[N], ret[N];
int n;

inline void upd(int &x, int y) {
	x = add(x, y);
}

inline void dec(int &x, int y) {
	x = sub(x, y);
}

int main() {
	cin >> n >> md; M = FastMod(md);
	dp[1][1][0] = 1;
	for (int i = 2; i <= n * 2; i++) {
		for (int j = 0; j <= min(n, i); j++) {
			for (int k = 0; k <= min(n, i) - j; k++) {
				upd(dp[i][j][k], dp[i - 1][j + 1][k]);
				upd(dp[i][j][k], dp[i - 1][j][k + 1]);
				if (j) upd(dp[i][j][k], dp[i - 1][j - 1][k]);
				if (k) upd(dp[i][j][k], dp[i - 1][j][k - 1]);
				for (int t = 1; t <= i / 2; t++) {
					dec(dp[i][j][k], mul(dp[i - t * 2][j][k], ret[t]));
				}
			}
		}
		if (i % 2 == 0) {
			ret[i / 2] = dp[i][0][0];
			dp[i][0][0] = 0;
		}
	}
	ans[0] = 1;
	for (int i = 1; i <= n; i++) {
		for (int j = 0; j < i; j++) upd(ans[i], mul(ans[j], ret[i - j]));
		cout << ans[i] << endl;
	}
	return 0;
}