#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ALL(a) a.begin(),a.end()
#define rep(i,n) for (int i = 0; i < n; i++)
#define rep1(i,n) for(int i=1;i<=(n);i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
#define rrep1(i, n) for (int i = (n); i > 0; i--)
#define REP(i, a, b) for (int i = a; i < b; i++)
#define ALL(a) a.begin(),a.end()
template<class T> ostream& operator << (ostream &s, vector<T> &P)
{ for (int i = 0; i < P.size(); ++i) { if (i > 0) { s << " "; } s << P[i]; } return s; }
template <class T>bool chmax(T &a, T b){if (a < b){a = b;return true;}return false;}
template <class T>bool chmin(T &a, T b){if (a > b){a = b;return true;}return false;}
using P  = pair<int,int>;
const int inf = 1e18;

int N,M;
const int MAXN = 100;
const int MAXINV = MAXN * MAXN;
vector<vector<int>> DP0(MAXN + 10,vector<int>(MAXINV + MAXN + 10,0));
vector<vector<int>> DP1(MAXN + 10,vector<int>(MAXINV + MAXN + 10,0));

signed main(){
    cin>>N>>M;
    DP0[0][0] = 1;

    rep(i,2*N){
        if (i % 2 == 0){
            rep(dif,MAXN + 1)rep(inv,MAXINV + 1){
                DP1[dif][inv] = 0;
            }
            rep(dif,MAXN + 1)rep(inv,MAXINV + 1){
                int v = DP0[dif][inv] % M;
                DP1[dif + 1][inv + (i - dif) / 2] += v;
                if (dif > 0)DP1[dif - 1][inv] += v;
            }
        }
        else{
            rep(dif,MAXN + 1)rep(inv,MAXINV + 1){
                DP0[dif][inv] = 0;
            }
            rep(dif,MAXN + 1)rep(inv,MAXINV + 1){
                int v = DP1[dif][inv] % M;
                DP0[dif + 1][inv + (i - dif) / 2] += v;
                if (dif > 0)DP0[dif - 1][inv] += v;
            }
        }
    }
  
    rep(i,N * N + 1){
        int res = DP0[0][i] % M;
        if (res < 0){res += M;}
        cout << res << endl;
    }
    return 0;
}