#include <bits/stdc++.h>

using namespace std;
using ll = long long;

int main(){

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

    for (int i=0; i<=N*N; i++) cout << dp[N][i] << '\n';

    return 0;
}