#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (int i = m; i < n; ++i)
#define FORR(i, m, n) for (int i = m; i >= n; --i)
#define ALL(v) (v).begin(),(v).end()
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
const ll INF=1LL<<60;
const int inf=(1<<30)-1;
const int mod=1e9+7;
int dx[8]={1,0,-1,0,-1,-1,1,1};
int dy[8]={0,1,0,-1,-1,1,-1,1};
int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    ll n,m;cin >> n >> m;
    vector dp(2*n+1,vector(n*n+1,vector(2*n+1,0LL)));
    dp[0][0][0]=1;
    REP(i,2*n){
        REP(j,n*n+1){
            REP(k,i/2+1){
                if(dp[i][j][k]==0) continue;
                (dp[i+1][j+k][k]+=dp[i][j][k])%=m;
                (dp[i+1][j][k+1]+=dp[i][j][k])%=m;
            }
        }
    }
    REP(i,n*n+1){
        cout << dp[2*n][i][n] << endl;
    }
}