#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 PB push_back
using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;
using namespace std;const int N=5e2+5,M=N*50+5,K=N*4+5,mod=1e9+7,Mod=mod-1;const db eps=1e-9;const int INF=1e9+7;mt19937 rnd(time(0));
int n,m,k,x,y,z,p;ll f[N][N],g[N][N];
int main(){
	int i,j,h;scanf("%d%d",&n,&p);for(i=1;i<=n;i++) f[1][i]=i;
	for(i=2;i<=n;i++){
		ll Ts=0;for(j=1;j<=i;j++) Ts+=f[j][1]*j;printf("%lld\n",Ts%p);
		Mc(g,f);Me(f,0);
		for(j=1;j<=i;j++){
			for(h=1;h<=n;h++){
				f[j][h-1]=(f[j][h-1]+(g[j][h]+p-g[j][h-1])*j*(h-1))%p;
				f[j+1][h]=(f[j+1][h]+g[j][h]*j*h)%p;
				f[j][h]=(f[j][h]+(p-g[j][h])*j*h)%p;
			}
		}
	}
}