#include <stdio.h>
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
using mint = modint;
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf 1000000001

struct combi{
	deque<mint> kaijou;
	deque<mint> kaijou_;
	
	combi(int n){
		kaijou.push_back(1);
		for(int i=1;i<=n;i++){
			kaijou.push_back(kaijou[i-1]*i);
		}
		
		mint b=kaijou[n].inv();
		
		kaijou_.push_front(b);
		for(int i=1;i<=n;i++){
			int k=n+1-i;
			kaijou_.push_front(kaijou_[0]*k);
		}
	}
	
	mint combination(int n,int r){
		if(r>n)return 0;
		mint a = kaijou[n]*kaijou_[r];
		a *= kaijou_[n-r];
		return a;
	}
	
	mint junretsu(int a,int b){
		mint x = kaijou_[a]*kaijou_[b];
		x *= kaijou[a+b];
		return x;
	}
	
	mint catalan(int n){
		return combination(2*n,n)/(n+1);
	}
	
};

int main(){
	
	int N,M;
	cin>>N>>M;
	
	mint::set_mod(M);
	
	vector<mint> sz(N+1,0);
	sz[1] = 1;
	for(int i=2;i<sz.size();i++){
		sz[i] = mint(i).pow(i-2);
	}
	
	vector dp(N+1,vector<mint>(N+1,0));
	dp[0][0] = 1;
	
	combi C(10000);
	
	rep(i,N+1){
		rep(j,N+1){
			int rem = N-i;
			if(dp[i][j]==0)continue;
			for(int k=1;k<=N;k++){
				if(rem < k)break;
				mint t = C.combination(rem-1,k-1);
				t *= dp[i][j];
				t *= sz[k];
				dp[i+k][j+1] += t;
			}
		}
	}
	
	vector<mint> ans(N,0);
	for(int i=1;i<=N;i++){
		ans[N-i] = dp.back()[i];
	}
	
	rep(i,N)cout<<ans[i].val()<<endl;
		
	
	return 0;
}