#include <bits/stdc++.h>
#include "atcoder/all"
#define debug cout << "OK" << endl;
template<typename T>
inline bool chmax(T& a, const T b) { if (a < b) { a = b; return true; } return false; }
template<typename T>
inline bool chmin(T& a, const T b) { if (a > b) { a = b; return true; } return false; }
inline int Code(char c) {
	if ('A' <= c and c <= 'Z')return (int)(c - 'A');
	if ('a' <= c and c <= 'z')return (int)(c - 'a');
	if ('0' <= c and c <= '9')return (int)(c - '0');
	assert(false);
}
using namespace std;
using namespace atcoder;
#define int long long
constexpr int MOD = 998244353;
constexpr int INF = (1LL << 63);
using minit = modint998244353;

template<typename T>
ostream& operator << (ostream& st, const vector<T>& v) {
	for (const T value : v) {
		st << value << " ";
	}
	return st;
}
template<typename T>
istream& operator >> (istream& st, vector<T>& v) {
	for (T& value : v) {
		st >> value;
	}
	return st;
}

struct edge {
	int to, cost;
};

//

//

class Solver {
public:
	int T;
	Solver() :T(1) {}
	~Solver(){}
	void multi();
	void solve() const;
	void sp(int x)const;
};
void Solver::multi() {
	cin >> T;
	return;
}
void Solver::sp(const int x)const {
	cout << fixed << setprecision(x) << endl;
	return;
}

void Solver::solve() const {
	int N, M;
	cin >> N >> M;
	modint::set_mod(M);
	vector<vector<vector<modint>>> DP(2 * N + 1, vector<vector<modint>>(N * N + 2 * N + 2, vector<modint>(N + 3, 0)));
	DP[0][0][0] = 1;
	for (int i = 0; i < 2 * N; i++) {
		for (int j = 0; j <= N * N; j++) {
			for (int k = 0; k <= i / 2; k++) {
				DP[i + 1][j + k][k] += DP[i][j][k];
				if (i == 2 * k)continue;
				DP[i + 1][j][k + 1] += DP[i][j][k];
			}
		}
	}
	for (int i = 0; i <= N * N; i++) {
		cout << DP[2 * N][i][N].val() << endl;
	}
}

signed main() {
	Solver solver;
	//solver.multi();
	//solver.sp();
	for (int i = 0; i < solver.T; i++)
		solver.solve();
	return 0;
}

/*
* わらびのコードこーどすぺーす
 (σ･∀･)σｹﾞｯﾂ!!
*/