#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <tuple>
#include <cmath>
#include <numeric>
#include <functional>
#include <cassert>
#include <atcoder/modint>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

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

using namespace std;
typedef long long ll;

using mint = atcoder::modint;
ll MOD = 1;


mint pow(mint a, ll n) {
    assert(n >= 0);
	mint ans = 1;
	mint tmp = a;
	for (int i = 0; i <= 60; i++) {
		ll m = (ll)1 << i;
		if (m & n) {
		ans *= tmp;
		}
		tmp *= tmp;
	}
	return ans;
}

#define N_MAX 200002
mint inv[N_MAX],fac[N_MAX],finv[N_MAX];

void init(){
    fac[0]=1;fac[1]=1;
    finv[0]=1;finv[1]=1;
    inv[1]=1;
    for(int i=2;i<N_MAX;i++){
        inv[i]=mint(MOD)-inv[MOD%i]*(MOD/i);
        fac[i]=fac[i-1]*(ll) i;
        finv[i]=finv[i-1]*inv[i];
    }
}

mint comb(ll n, ll r){
    if(n < r){
        return mint(0);
    }else{
        return fac[n]*finv[r]*finv[n-r];
    }
}

mint dp[305][305][305];

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    int n; cin >> n >> MOD;
    atcoder::modint::set_mod(MOD);
    init();
    vector<mint> v(n+1);
    v[0] = 0;
    v[1] = 1;
    for(int i = 2; i <= n; i++) v[i] = pow(mint(i), i-2);
    dp[0][0][0] = 1;
    for(int i = 1; i <= n; i++){
        for(int j = 0; j <= n; j++){
            for(int k = 0; k <= n; k++){
                mint cur = 1;
                mint iv = 1;
                for(int l = 0; i*l+j <= n; l++){
                    int nxj = i*l+j;
                    int nxk = k+l;
                    int rem = n-j;
                    dp[i][nxj][nxk] += dp[i-1][j][k]*comb(rem, i*l)*finv[l]*fac[i*l]*iv*cur;
                    cur *= v[i];
                    iv *= finv[i];
                }
            }
        }
    }
    for(int i = 0; i <= n-1; i++){
        int j = n-i;
        cout << dp[n][n][j].val() << endl;
    }
}