//什么时候我才能有杜爷一半强呀/kk
#include<cstdio>
#include<cstring>
const int N=503;
int n,MOD,f[N][N],g[N][N];
inline int Add(int &a,int b){return(a+=b)>=MOD?a-=MOD:a;}
inline int vAdd(int a,int b){return(a+=b)>=MOD?a-=MOD:a;}
inline int Sub(int &a,int b){return(a-=b)<0?a+=MOD:a;}
inline int vSub(int a,int b){return(a-=b)<0?a+=MOD:a;}
inline int Mul(int a,int b){return 1ll*a*b%MOD;}
inline int read(){
	char ch=getchar();int nn=0,ssss=1;
	while(ch<'0'||ch>'9'){if(ch=='-')ssss*=-1;ch=getchar();}
	while(ch>='0'&&ch<='9'){nn=nn*10+(ch-'0');ch=getchar();}
	return nn*ssss;
}
int main(){
	int n=read();MOD=read();
	for(int i=1;i<=n;i++)f[1][i]=i;
	for(int i=2;i<=n;i++){
		int ans=0;
		for(int j=1;j<=i;j++)Add(ans,Mul(f[j][1],j));
		printf("%d\n",ans);
		std::memcpy(g,f,sizeof(f));
		std::memset(f,0,sizeof(f));
		for(int x=1;x<=i;x++)
			for(int y=1;y<=n;y++){
				Add(f[x][y-1],Mul(x*(y-1),g[x][y]));
				Add(f[x+1][y],Mul(x*y,g[x][y]));
				Sub(f[x][y],Mul(x*y,g[x][y]));
				Sub(f[x][y],Mul(x*y,g[x][y]));
			}
	}
}