#include "bits/stdc++.h" #define int long long using namespace std; using ll = long long; using P = pair; const ll INF = (1LL << 61); ll mod = 1000000007; int dp[102][102][10010]; signed main() { ios::sync_with_stdio(false); cin.tie(0); int N, M; cin >> N >> M; vector>dp(101, vector(10010)); dp[0][0] = 1; for (int i = 0; i < 2 * N; i++) { vector>now(101, vector(10010)); for (int j = 0; j <= min(i, N); j++) { for (int k = 0; k <= N*N; k++) { if (i < 2 * j) { now[j][k] += dp[j][k]; now[j][k] %= M; } if (k + i - j <= N * N&&j < N) { now[j + 1][k + i - j] += dp[j][k]; now[j + 1][k + i - j] %= M; } } } dp = now; } for (int k = 0; k <= N * N; k++) { cout << dp[N][k] << '\n'; } return 0; }