#include <stdio.h>
#include <atcoder/all>
#include <bits/stdc++.h>
using namespace std;
using namespace atcoder;
using mint = modint;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf 1000000000

int main(){
	
	int N,M;
	cin>>N>>M;
	
	mint::set_mod(M);
	
	vector dp(N+1,vector<mint>(N*N+1,0));
	dp[0][0] = 1;
	
	rep(_,2*N){
		vector ndp(N+1,vector<mint>(N*N+1,0));
		
		rep(i,N+1){
			rep(j,N*N+1){
				if(dp[i][j]==0)continue;
				int cnt0 = i,cnt1 = _-i;
				//0を足す
				if(i!=N)ndp[i+1][j+cnt1] += dp[i][j];
				
				//1を足す
				if(cnt0 >= cnt1+1){
					ndp[i][j] += dp[i][j];
				}
				
			}
		}
		swap(dp,ndp);
		
	
		
	}
	
	
	rep(i,N*N+1){
		cout<<dp[N][i].val()<<endl;
	}
	
    return 0;
}