#include<bits/stdc++.h>

#define pb push_back
#define fi first
#define se second
#define mp make_pair

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef long double ld;

template <typename T> bool chkmin(T &x,T y){return x>y?x=y,1:0;}
template <typename T> bool chkmax(T &x,T y){return x<y?x=y,1:0;}

int readint(){
	int x=0,f=1; char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
	while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
	return x*f;
}

const int B=10;
int n,cys;
ll f[505][15],d[505][15],ansf[505][15],ansd[505][15],ans[505],ansh[505],h[505][15],g[505][15],fac[505],inv[505];

ll mod(ll x){return x>=cys?x-cys:x;}

ll qpow(ll x,ll p){
	ll ret=1;
	for(;p;p>>=1,x=x*x%cys) if(p&1) ret=ret*x%cys;
	return ret;
}

ll C(ll x,ll y){
	ll ret=1;
	for(int i=1;i<=y;i++) ret=ret*mod(x+cys-i+1)%cys;
	return ret*inv[y]%cys;
}

int main(){
	n=readint(); cys=readint();
	fac[0]=inv[0]=1;
	for(int i=1;i<=n;i++) fac[i]=fac[i-1]*i%cys;
	inv[n]=qpow(fac[n],cys-2);
	for(int i=n-1;i>=1;i--) inv[i]=inv[i+1]*(i+1)%cys;
	for(int i=0;i<=B;i++) f[0][i]=d[0][i]=1;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=B;j++){
			for(int k=0;k<i;k++){
				d[i][j]=(d[i][j]+f[i-k-1][j-1]*mod(d[k][j]+cys-d[k][j-1]))%cys;
				if(!k) d[i][j]=mod(d[i][j]+f[i-k-1][j-1]);
				h[i][j]=(h[i][j]+f[i-k-1][j-1]*h[k][j])%cys;
				h[i][j]=(h[i][j]+f[i-k-1][j-1]*g[k][j])%cys;
			}
			for(int k=1;k<i&&i+k<=n;k++) g[i+k][j]=(g[i+k][j]+mod(d[i][j]+cys-d[i][j-1])*mod(d[k][j]+cys-d[k][j-1]))%cys;
			if(i+i<=n) g[i+i][j]=mod(g[i+i][j]+C(mod(d[i][j]+cys-d[i][j-1])+1,2));
			for(int k=n;k>=0;k--){
				for(int l=j;l<=B;l++){
					ll tmp=1,val=mod(d[i][j]+cys-d[i][j-1]);
					for(int t=1;k+t*i<=n;t++){
						tmp=tmp*(val+t-1)%cys;
						f[k+t*i][l]=(f[k+t*i][l]+f[k][l]*tmp%cys*inv[t])%cys;
					}
				}
			}
		}
		// for(int j=1;j<=B;j++) cout<<'('<<d[i][j]<<' '<<f[i][j]<<") ";
		// cout<<endl;
	}
	for(int i=0;i<=B;i++) ansf[0][i]=1;
	for(int i=1;i<=(n-1)/2;i++){
		for(int j=1;j<=B;j++){
			for(int k=n;k>=0;k--){
				for(int l=j;l<=B;l++){
					ll tmp=1,val=mod(d[i][j]+cys-d[i][j-1]);
					for(int t=1;k+t*i<=n;t++){
						tmp=tmp*(val+t-1)%cys;
						ansf[k+t*i][l]=(ansf[k+t*i][l]+ansf[k][l]*tmp%cys*inv[t])%cys;
					}
				}
			}
		}
	}
	for(int i=1;i<=(n-1)/2;i++){
		for(int j=i;j<=(n-1)/2;j++){
			for(int k=1;k<=B;k++){
				if(i!=j) ansd[i+j][k]=(ansd[i+j][k]+mod(d[i][k]+cys-d[i][k-1])*mod(d[j][k]+cys-d[j][k-1]))%cys;
				else ansd[i+j][k]=mod(ansd[i+j][k]+C(mod(d[i][k]+cys-d[i][k-1])+1,2));
			}
		}
	}
	for(int i=1;i<=(n-1)/2;i++)
		for(int j=1;j<=B;j++)
			ansd[i][j]=mod(ansd[i][j]+mod(d[i][j]+cys-d[i][j-1]))%cys;
	for(int i=1;i<=B;i++){
		for(int k=0;k<n;k++){
			ans[i]=(ans[i]+ansf[n-k-1][i-1]*ansd[k][i])%cys;
			if(!k) ans[i]=mod(ans[i]+ansf[n-k-1][i-1]);
			if(k&&k<=(n-1)/2) ansh[i]=(ansh[i]+ansf[n-k-1][i-1]*h[k][i])%cys;
		}
	}
	// for(int i=1;i<=n;i++){
	// 	for(int j=1;j<=B;j++) cout<<ansd[i][j]<<' ';
	// 	cout<<endl;
	// }
	if(n%2==0){
		for(int i=1;i<=B;i++){
			ans[i]=mod(ans[i]+C(d[n/2][i]+1,2));
			ansh[i]=mod(ansh[i]+d[n/2][i-1]*h[n/2][i])%cys;
		}
	}
	for(int i=B;i>=1;i--) ans[i]=mod(ans[i]+cys-ans[i-1]);
	for(int i=1;i<=B;i++) ans[i]=mod(ans[i]+ansh[i]),ans[i+1]=mod(ans[i+1]+cys-ansh[i]);
	for(int i=1;i<=n;i++) printf("%lld ",ans[i]);
	printf("\n");
	return 0;
}