#include "bits/stdc++.h"
#include "atcoder/all"
using namespace std;
using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
//const bool debug = false;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
long long dp[202][101][5010];//i番目まで見た,0の個数がj,転倒数がk
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, m; cin >> n >> m;
	dp[0][0][0] = 1;
	rep(i, 2 * n) {
		rep(j, min(i, n) + 1) {
			rep(k, n * (n - 1) / 2 + 1) {
				rep(l, 2) {
					int nj = j + l;//zero
					int subj = (i + 1) - nj;//one
					int nk = k;
					if (1 == l) nk += subj;
					if (nj < subj) continue;
					dp[i + 1][nj][nk] += dp[i][j][k];
					dp[i + 1][nj][nk] %= m;
				}
			}
		}
	}
	rep(i, n*n + 1) {
		if (i <= n * (n - 1) / 2)cout << dp[2 * n][n][i] << endl;
		else  cout << 0 << endl;
	}
	return 0;
}