// what is matter? never mind. 
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,sse4,popcnt,abm,mmx,avx,avx2") 
#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(int i=(a);i>=(b);--i)
#define ll long long
//#define int long long
using namespace std;
inline int read()
{
    char c=getchar();int x=0;bool f=0;
    for(;!isdigit(c);c=getchar())f^=!(c^45);
    for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
    if(f)x=-x;return x;
}
 
int mod;
typedef unsigned long long ull;
namespace FM{
	typedef __uint128_t L;
	struct FastMod{
		ull b,m;
		FastMod(ull b):b(b),m(ull((L(1)<<64)/b)){}
		ull reduce(ull a){ull q=(ull)((L(m)*a)>>64),r=a-q*b;return r>=b?r-b:r;}
	};
	FastMod F(2);
}

struct modint{
	int x;
	modint(int o=0){x=o;}
	modint &operator = (int o){return x=o,*this;}
	modint &operator +=(modint o){return x=x+o.x>=mod?x+o.x-mod:x+o.x,*this;}
	modint &operator -=(modint o){return x=x-o.x<0?x-o.x+mod:x-o.x,*this;}
	modint &operator *=(modint o){return x=FM::F.reduce(1ull*x*o.x),*this;}
	modint &operator ^=(int b){
		modint a=*this,c=1;
		for(;b;b>>=1,a*=a)if(b&1)c*=a;
		return x=c.x,*this;
	}
	modint &operator /=(modint o){return *this *=o^=mod-2;}
	friend modint operator +(modint a,modint b){return a+=b;}
	friend modint operator -(modint a,modint b){return a-=b;}
	friend modint operator *(modint a,modint b){return a*=b;}
	friend modint operator /(modint a,modint b){return a/=b;}
	friend modint operator ^(modint a,int b){return a^=b;}
	friend bool operator ==(modint a,int b){return a.x==b;}
	friend bool operator !=(modint a,int b){return a.x!=b;}
	bool operator ! () {return !x;}
	modint operator - () {return x?mod-x:0;}
	bool operator <(const modint&b)const{return x<b.x;}
};
inline modint qpow(modint x,int y){return x^y;}
void initmod(){mod=read(),FM::F=FM::FastMod(mod);}
 
vector<modint> fac,ifac,iv;
inline void initC(int n)
{
    if(iv.empty())fac=ifac=iv=vector<modint>(2,1);
    int m=iv.size(); ++n;
    if(m>=n)return;
    iv.resize(n),fac.resize(n),ifac.resize(n);
    For(i,m,n-1){
        iv[i]=iv[mod%i]*(mod-mod/i);
        fac[i]=fac[i-1]*i,ifac[i]=ifac[i-1]*iv[i];
    }
}
inline modint C(int n,int m){
    if(m<0||n<m)return 0;
    return initC(n),fac[n]*ifac[m]*ifac[n-m];
}
inline modint sign(int n){return (n&1)?(mod-1):(1);}
 
#define fi first
#define se second
#define pb push_back
#define mkp make_pair
typedef pair<int,int>pii;
typedef vector<int>vi;
 
#define maxn 200005
#define inf 0x3f3f3f3f

int n;
modint f[505][12]; // tree [size=i][label=j]
modint g[505][12][4]; // forest [size=i][label=j][label j counts k]
modint tmp[505];

modint dp[505][12]; 
/*
dp from down to up
now size=i
needed : up subtree label<=j
*/

modint ans[505];

signed main()
{
	n=read(),initmod(),initC(n+1);
	g[0][0][3]=g[0][1][0]=1;
	For(d,1,10){
		For(i,1,n){
			f[i][d]=g[i-1][d][1]+g[i-1][d-1][2]+g[i-1][d-1][3];
			if(i*2>=n)continue;
			tmp[0]=1;
			For(k,1,n/i)tmp[k]=tmp[k-1]*(f[i][d]+k-1)*iv[k];
			Rep(i2,n-1,i)
				For(c,1,i2/i)
					For(p,0,3)
						g[i2][d][min(p+c,3)]+=g[i2-i*c][d][p]*tmp[c];
		}
		For(i,0,n)For(k,0,3)g[i][d+1][0]+=g[i][d][k];
	}
	For(d,1,10){
		memset(dp,0,sizeof dp);
		For(i,1,n){
			dp[i][d-1]+=g[i-1][d][2];
			Rep(j,d-1,0)
				For(k,1,i-1){
					if(k*2>=n)break;
					dp[i][j]+=g[i-k-1][j+1][1]*dp[k][j+1];
					dp[i][j]+=g[i-k-1][j][0]*dp[k][j];
				}
		}
		modint &res=ans[d];
		For(i,1,d)res+=f[n][i]+dp[n][i-1];
		if(n%2==0){
			modint sum=0;
			For(i,1,d)sum+=f[n/2][i];
			res+=sum*(sum+1)*((mod+1)/2);
			modint s2=0;
			For(i,1,d-1){
				s2+=f[n/2][i];
				res+=dp[n/2][i]*s2;
			}
		}
	}
	//For(i,1,10)cout<<ans[i].x<<" "; cout<<"\n";
	Rep(i,10,1)ans[i]-=ans[i-1];
	For(i,1,n)cout<<ans[i].x<<" ";
    return 0;
}
/*
3 1000000007 
*/