#include <bits/stdc++.h>

#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define FOR(i,n,m) for(int i=(int)(n); i<=(int)(m); i++)
#define RFOR(i,n,m) for(int i=(int)(n); i>=(int)(m); i--)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define RITR(x,c) for(__typeof(c.rbegin()) x=c.rbegin();x!=c.rend();x++)
#define setp(n) fixed << setprecision(n)

template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }

#define ll long long
#define vll vector<ll>
#define vi vector<int>
#define pll pair<ll,ll>
#define pi pair<int,int>

#define all(a) (a.begin()),(a.end())
#define rall(a) (a.rbegin()),(a.rend())
#define fi first
#define se second
#define pb push_back
#define ins insert

#define debug(a) cerr<<(a)<<endl
#define dbrep(a,n) rep(_i,n) cerr<<(a[_i])<<" "; cerr<<endl
#define dbrep2(a,n,m) rep(_i,n){rep(_j,m) cerr<<(a[_i][_j])<<" "; cerr<<endl;}

using namespace std;

template<class A, class B>
ostream &operator<<(ostream &os, const pair<A,B> &p){return os<<"("<<p.fi<<","<<p.se<<")";}
template<class A, class B>
istream &operator>>(istream &is, pair<A,B> &p){return is>>p.fi>>p.se;}

template<class T>
vector<T> make_vec(size_t a){
	return vector<T>(a);
}
template<class T, class... Ts>
auto make_vec(size_t a, Ts... ts){
	return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));
}

//-------------------------------------------------

int main(void)
{
    cin.tie(0);
    ios::sync_with_stdio(false);
	int N, mod; cin>>N>>mod;
	
	// Binomial
	auto bn = make_vec<int>(N,N);
	bn[0][0] = 1;
	FOR(i,1,N-1)rep(j,N){
		if (j > 0){
			bn[i][j] = bn[i-1][j-1]+bn[i-1][j];
			if (bn[i][j] >= mod) bn[i][j] -= mod;
		}else{
			bn[i][j] = bn[i-1][j];
		}
	}
	
	// Cayley
	vll c(N+1,1);
	rep(i,N+1){
		rep(j,i-2){
			(c[i]*=i)%=mod;
		}
	}
	
	auto dp = make_vec<ll>(N+1,N);
	dp[0][0] = 1;

	rep(i,N)rep(j,N){
		for(int k=1; i+k<=N; k++){
			if (k==1){
				dp[i+k][j+k-1] += dp[i][j];
				if (dp[i+k][j+k-1] >= mod) dp[i+k][j+k-1] -= mod;
			}else{
				dp[i+k][j+k-1] += ((bn[N-i-1][k-1]*c[k])%mod*dp[i][j])%mod;
				if (dp[i+k][j+k-1] >= mod) dp[i+k][j+k-1] -= mod;
			}
		}
	}
	rep(j,N){
		cout<<dp[N][j]<<"\n";
	}

    return 0;
}