#include <iostream>
#include <algorithm>
#define rep(i, n) for(i = 0; i < n; i++)
using namespace std;

int n, m;
int dp[2][101][4951];

int snuke(int n, int i) {
	return min(i, 2 * n - i);
}

//途中は良いカッコ列じゃなくて良いので、転倒数が結構増えることに注意
int rng(int n, int i) {
	return min(((i + 1) / 2) * (i / 2), n * (n - 1) / 2);
}

signed main() {
	int i, j, k;
	
	cin >> n >> m;
	
	dp[0][0][0] = 1;
	rep(i, 2 * n) {
		int snu1 = snuke(n, i);
		int rin1 = rng(n, i);
		int snu2 = snuke(n, i + 1);
		int rin2 = rng(n, i + 1);
		
		for (j = 0; j <= snu1; j++) {
			if ((i - j) & 1) continue;
			int one = (i - j) / 2;
			
			if (j + 1 <= snu2) {
				int *ptr1s = &dp[1][j + 1][one];
				int *ptr0s = &dp[0][j][0];
				int *ptr1e = ptr1s + rin1 + 1;
				while (ptr1s != ptr1e) {
					*ptr1s += *ptr0s;
					if (*ptr1s >= m) *ptr1s -= m;
					ptr1s++; ptr0s++;
				}
			}
			if (j - 1 >= 0) {
				int *ptr1s = &dp[1][j - 1][0];
				int *ptr0s = &dp[0][j][0];
				int *ptr1e = ptr1s + rin1 + 1;
				while (ptr1s != ptr1e) {
					*ptr1s += *ptr0s;
					if (*ptr1s >= m) *ptr1s -= m;
					ptr1s++; ptr0s++;
				}
			}
		}
		rep(j, snu2 + 1) rep(k, rin2 + 1) dp[0][j][k] = dp[1][j][k];
		rep(j, snu2 + 1) rep(k, rin2 + 1) dp[1][j][k] = 0;
	}
	
	rep(i, n * n + 1) {
		if (i > rng(n, 2 * n)) { cout << 0 << endl; continue; }
		cout << dp[0][0][i] << endl;
	}
	return 0;
}