#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)n; i++)
using ll = long long;
ll mod;

struct mint {
  ll x;
  mint(ll _x = 0) {if((_x %= mod) < 0) _x += mod; x = _x;}
  bool operator==(const mint a) {return x == a.x;}
  mint operator-() const {return mint(-x);}
  mint& operator+=(const mint a) {
    if((x += a.x) >= mod) x -= mod;
    return *this;
  }
  mint& operator-=(const mint a) {
    if((x += mod-a.x) >= mod) x -= mod;
    return *this;
  }
  mint& operator*=(const mint a) {
    (x *= a.x) %= mod;
    return *this;
  }
  mint operator+(const mint a) const {
    mint res(*this);
    return res+=a;
  }
  mint operator-(const mint a) const {
    mint res(*this);
    return res-=a;
  }
  mint operator*(const mint a) const {
    mint res(*this);
    return res*=a;
  }
  mint pow(ll t) const {
    if(!t) return 1;
    mint a = pow(t>>1);
    a *= a;
    if(t&1) a *= *this;
    return a;
  }
  // for prime mod
  mint inv() const {return pow(mod-2);}
  mint& operator/=(const mint a) {return (*this) *= a.inv();}
  mint operator/(const mint a) const {
    mint res(*this);
    return res/=a;
  }
  ll val() {return x;}
};

int main(){
  int n;
  cin >> n >> mod;
  vector<vector<mint>> dp(n+1,vector<mint>(n*n+1));
  dp[0][0].x = 1;
  rep(i,2*n) {
    vector<vector<mint>> dpn(n+1,vector<mint>(n*n+1));
    int l = min(i+1,n+1);
    rep(j,l) {
      rep(k,n*n+1) {
        if(k+i-j <= n*n and j < n) dpn[j+1][k+i-j] += dp[j][k];
        if(i < 2*j) dpn[j][k] += dp[j][k]; 
      }
    }
    swap(dp,dpn);
  } 
  rep(i,n*n+1) cout << dp[n][i].val() << endl;
  return 0;
}