#include <iostream> #include <algorithm> #include <string> #include <vector> #include <cmath> #include <map> #include <queue> #include <iomanip> #include <set> #include <tuple> #define mkp make_pair #define mkt make_tuple #define rep(i,n) for(int i = 0; i < (n); ++i) #define all(v) v.begin(),v.end() using namespace std; typedef long long ll; const ll MOD=1e9+7; template<class T> void chmin(T &a,const T &b){if(a>b) a=b;} template<class T> void chmax(T &a,const T &b){if(a<b) a=b;} int main(){ cin.tie(0); ios::sync_with_stdio(false); int N; ll M; cin>>N>>M; int all=2*N; vector<vector<ll>> dp(N+1,vector<ll> (N*N+1,0)); dp[0][0]=1; for(int i=0;i<all;i++){ vector<vector<ll>> ndp(N+1,vector<ll> (N*N+1,0)); for(int j=0;j<=N;j++){ for(int k=0;k<=N*N;k++){ ll value=dp[j][k]; if(value==0) continue; int zero=j,one=i-j; if(zero+1<=N){// 0 ndp[zero+1][k+one]+=value; ndp[zero+1][k+one]%=M; } if(zero>=one+1){ ndp[zero][k]+=value; ndp[zero][k]%=M; } } } swap(dp,ndp); } rep(k,N*N+1){ cout<<dp[N][k]<<"\n"; } return 0; }