#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <bitset>
#include <climits>
#include <cmath>
#include <complex>
#include <functional>
#include <cassert>
#include <stack>
#include <numeric>
#include <iomanip>
#include <limits>
#include <random>
#include <unordered_map>
#include <unordered_set>
#include <chrono>
#include <cstring>

typedef long long ll;
typedef std::pair<int, int> Pii;
typedef std::pair<ll, ll> Pll;
typedef std::pair<double, double> Pdd;

#define rip(_i, _n, _s) for (int _i = (_s); _i < (int)(_n); _i++)
#define all(_l) _l.begin(), _l.end()
#define rall(_l) _l.rbegin(), _l.rend()
#define MM << " " <<

template<typename _T>
using MaxHeap = std::priority_queue<_T>;
template<typename _T>
using MinHeap = std::priority_queue<_T, std::vector<_T>, std::greater<_T>>;

template<typename _T>
inline bool chmax(_T &_l, const _T _b) {
    if (_b > _l) {
        _l = _b;
        return true;
    }
    return false;
}
template<typename _T>
inline bool chmin(_T &_l, const _T _b) {
    if (_l > _b) {
        _l = _b;
        return true;
    }
    return false;
}

template<typename _T>
void vdeb(const std::vector<_T> &bb) {
    for (unsigned int i = 0;i < bb.size();i++) {
        if (i == bb.size() - 1) std::cout << bb[i];
        else std::cout << bb[i] << ' ';
    }
    std::cout << '\n';
}
template<typename _T>
void vdeb(const std::vector<std::vector<_T>> &bb) {
    for (unsigned int i = 0;i < bb.size();i++) {
        std::cout << i << ": ";
        vdeb(bb[i]);
    }
    std::cout << '\n';
}

using namespace std;

ll modpow(ll n, ll k, ll m) {
    ll ret = 1, now = n;
    while(k) {
        if(k&1) ret = ret * now % m;
        now = now * now % m;
        k /= 2;
    }
    return ret;
}

int main() {
    ll n, m; cin >> n >> m;
    vector<ll> forest(n+1, 1);
    rip(i,n+1,2) {
        rip(j,i-2,0) forest[i] = forest[i] * i % m;
    }
    vector<ll> frc(n+1, 1), inv(n+1, 1);
    rip(i,n+1,1) frc[i] = frc[i-1] * i % m;
    rip(i,n+1,1) inv[i] = modpow(frc[i], m-2, m);
    auto comb = [&](int n, int k) {
        return frc[n] * inv[k] % m * inv[n-k] % m;
    };
    vector<vector<ll>> dp(n+1, vector<ll>(n));
    dp[0][0] = 1;
    rip(i,n+1,0) rip(j, n, 0) {
        rip(k, n+1, 1) {
            if(i + k > n || j + k - 1 >= n) break;
            if(k == 1) dp[i+1][j] = (dp[i+1][j] + dp[i][j]) % m;
            else {
                dp[i+k][j+k-1] = (dp[i+k][j+k-1] + comb(n-i-1,k-1) * forest[k] % m * dp[i][j] % m) % m;
            }
        }
    }
    rip(i,n,0) cout << dp[n][i] << endl;
}