#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define _GLIBCXX_DEBUG
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
ll ILL=1167167167167167167;
const int INF=2100000000;
const ll mod=1e9+7;
#define rep(i,a) for (int i=0;i<a;i++)
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
void yneos(bool a){if(a) cout<<"Yes\n"; else cout<<"No\n";}



void solve();
//  rainy ~ 雨に打たれて ~
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	
	int t=1;
	//cin>>t;
	rep(i,t) solve();
}

void solve(){
    ll N,M;
    cin>>N>>M;
    vector<vector<ll>> dp(N+1,vector<ll>(N*N+1));
    dp[0][0]=1;
    rep(i,N*2){
        vector<vector<ll>> n_dp(N+1,vector<ll>(N*N+1));
        rep(j,N+1) rep(k,N*N+1){
            if(dp[j][k]==0) continue;
            if(j!=N) n_dp[j+1][k]=(n_dp[j+1][k]+dp[j][k])%M;
            if(j>i-j) n_dp[j][k+N-j]=(n_dp[j][k+N-j]+dp[j][k])%M;
        }
        swap(n_dp,dp);/*
        rep(j,N+1){
            rep(k,N*N+1) printf("%2d ",dp[j][k]);
            printf("\n");
        }
        printf("\n");*/
    }
    rep(i,N*N+1){
        cout<<dp[N][i]<<"\n";
    }
}