#include<bits/stdc++.h>
using namespace std;
const int N=505;

bool med;
static char buf[1000000],*p1=buf,*p2=buf;
#define getchar() p1==p2&&(p2=(p1=buf)+fread(buf,1,1000000,stdin),p1==p2)?EOF:*p1++
inline int wrd(){int x=0,f=1;char c=getchar();while(c<'0' || c>'9'){if(c=='-') f=-1;c=getchar();}while(c>='0' && c<='9') {x=(x<<3)+(x<<1)+c-48;c=getchar();}return x*f;}
inline void wrt(int x){static char buf[20];static int len=-1;if(x<0)putchar('-'),x=-x;do buf[++len]=x%10,x/=10;while(x);while(len>=0)putchar(buf[len--]+48);}

int n,mod,f[N][N][N];
void ad(int &a,int b){(a+=b)>=mod && (a-=mod);}
bool mde;

signed main(){
	cerr << (&med-&mde)/1048576.0 << "MB\n";
	n=wrd(),mod=wrd();
	for(int i=1;i<n;++i) f[1][1][i]=1;
	for(int i=2;i<=n;++i){
		int as=0;
		for(int j=1;j<=i;++j){
			for(int k=1;k<=n-i+1;++k){
				ad(f[i][j][k],1ll*f[i-1][j-1][k]*(j-1)%mod*k%mod);
				ad(f[i][j][k],1ll*f[i-1][j][k+1]*j%mod*(k+1)%mod);
				ad(f[i][j][k],mod-2ll*f[i-1][j][k]%mod*j%mod*k%mod);
				if(k==1) ad(as,1ll*f[i-1][j][k]*j%mod*k%mod);
			}
		}
		wrt(as),puts("");
	}
	return 0;
}