#include<bits/stdc++.h>
#define Gc() getchar() 
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define eb emplace_back
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;using LL=__int128;
const int N=4e2+5,M=N*120+5,K=(1<<25)+5,mod=998244353,Mod=mod-1;const db eps=1e-9;const int INF=1e9+7;mt19937 rnd(time(0));
int n,p;
ll f[N],g[N][N],C[N][N],ctl[N],dp[N][N],ans[N],ff[N];
void Solve(){
	int i,j,h;scanf("%d%d",&n,&p);
	for(i=0;i<=2*n;i++) for(C[i][0]=j=1;j<=i;j++) C[i][j]=(C[i-1][j]+C[i-1][j-1])%p;
	ctl[0]=1;for(i=1;i<=n;i++) for(j=0;j<i;j++) ctl[i]=(ctl[i]+ctl[j]*ctl[i-j-1])%p;
	for(i=2;i<=2*n;i++){
		for(j=0;2*j<=i;j++) ans[i]+=C[i][2*j]*ctl[j]%p*ctl[i/2-j]%p;
		ans[i]%=p;
	}
	g[0][0]=dp[0][0]=1;
	for(i=1;i<=2*n;i++){
		for(j=1;j<=i;j++) g[i][j]=g[i-1][j-1],dp[i][j]=dp[i-1][j-1];
		for(j=1;j<=i;j++){
			for(h=1;2*h+1<=i;h++){
				g[i][j]=(g[i][j]+ans[h*2]*g[i-2*h-1][j-1])%p;
				dp[i][j]=(dp[i][j]+f[h*2]*dp[i-2*h-1][j-1])%p;	
			}
		}
		if(i%2==0){
			f[i]=ans[i];
			for(j=2;j<i;j+=2) f[i]-=g[i][j]*ff[j]*2%p;
			f[i]=(f[i]%p+p)*(p+1)/2%p;ff[i]=f[i];
			for(j=2;j<i;j+=2) f[i]+=dp[i][j]*ff[j]%p;
			printf("%lld\n",f[i]%p);
		}
	}
}
int main(){
	int t=1;
	// scanf("%d",&t);
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}