#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

int N,M;

ll from[102][10101];
ll to[102][10101];
ll mo;
void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N>>mo;
	
	from[0][0]=1;
	FOR(i,2*N) {
		ZERO(to);
		FOR(x,N+1) FOR(y,10001) if(from[x][y]) {
			if(x<N) (to[x+1][y+(i-x)/2]+=from[x][y])%=mo;
			if(x) (to[x-1][y]+=from[x][y])%=mo;
		}
		swap(from,to);
	}
	
	FOR(i,N*N+1) cout<<from[0][i]<<endl;
	
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}