#include <bits/stdc++.h>

using namespace std;
using ll = long long;

int main(){

    ll N, M;
    cin >> N >> M;
    vector<vector<vector<ll>>> dp(2*N+1, vector(N+1, vector<ll>(N*N+1)));
    dp[0][0][0] = 1;
    for (int i=1; i<=N*2; i++){
        for (int j=0; j<=N; j++){
            for (int k=0; k<=N*N; k++){
                if (k+j<=N*N){
                    dp[i][j][k+j] += dp[i-1][j][k];
                    dp[i][j][k+j] %= M;
                }
                if (j+1<=N && i>=j*2+2){
                    dp[i][j+1][k] += dp[i-1][j][k];
                    dp[i][j+1][k] %= M;
                }
            }
        }
    }

    for (int i=0; i<=N*N; i++) cout << dp[N*2][N][i] << endl;

    return 0;
}