#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[8]={1,0,-1,0,1,1,-1,-1};
const ll dx[8]={0,1,0,-1,1,-1,1,-1};
template <typename T> inline bool chmax(T &a, T b) {
  return ((a < b) ? (a = b, true) : (false));
}
template <typename T> inline bool chmin(T &a, T b) {
  return ((a > b) ? (a = b, true) : (false));
}
ll dp[101][10010];//すでに0がiこ出ていて、転倒数がKである
int main(){
  ll n,m;cin >> n >>m;
  rep(i,101)rep(j,10010)dp[i][j]=0;
  dp[0][0]=1;
  ll ndp[101][10010];
  rep(i,2*n){
    rep(j,101)rep(k,10010)ndp[j][k]=0;
    rep(j,101){
      rep(k,10010){
        if(!dp[j][k])continue;
        if(j+1<=n)ndp[j+1][k]+=dp[j][k];ndp[j+1][k]%=m;
        if(j<i-j+1)continue;
        if(i-j+1<=n)ndp[j][k+n-j]+=dp[j][k];ndp[j][k+n-j]%=m;
      }
    }
    /*rep(j,3)rep(k,3){
      cout << ndp[j][k] <<" ";
    }
    cout << endl;*/
    swap(dp,ndp);
  }
  rep(j,n*n+1){
    ll ans=0;
    rep(k,101){
      ans+=dp[k][j];
      ans%=m;
    }
    cout << ans <<endl;
  }
}