#include <bits/stdc++.h>
#define ll long long
#define mp make_pair
#define fi first
#define se second
#define pb push_back
#define vi vector<int>
#define pi pair<int, int>
template<typename T> bool chkmin(T &a, T b){return (b < a) ? a = b, 1 : 0;}
template<typename T> bool chkmax(T &a, T b){return (b > a) ? a = b, 1 : 0;}
using namespace std;
const int maxn = 505;
int dp[maxn][maxn][maxn]; // index, 
ll ans[maxn];
int n, mod;

int main() {
    cin >> n >> mod;
    for (int k = 0; k <= n; k++)
        dp[1][0][k] = k;
    for (int i = 1; i < n; i++)
        for (int l = 0; l <= i; l++)
            for (int g = 0; g <= n; g++) {
               // if (dp[i][l][g]) cout << i << " " << l << " " << g << " " << dp[i][l][g] << endl;
                for (int tp = 0; tp < 4; tp++) {
                    if (tp == 0) continue;

                    int eg = g; 
                    if (!(tp & 2)) 
                        eg -= 1; // down not leaf

                    if (eg <= 0) continue;
                    ll cont = 1ll * (i - l) * dp[i][l][g] % mod * eg % mod;

                    int el = l;
                    if ((tp & 1)) el += 1;
                    if (tp == 3) cont *= -2, cont %= mod;
                    dp[i + 1][el][eg] = (dp[i + 1][el][eg] + cont) % mod;
                }
            }
    for (int i = 1; i <= n; i++)
        for (int k = 0; k <= i; k++) 
            ans[i + 1] = (ans[i + 1] + 1ll * dp[i][k][1] * (i - k)) % mod;
    for (int i = 2; i <= n; i++) {
        int res = ans[i];
        res %= mod;
        if (res < 0) res += mod;
        cout << res << endl;
    }
    return 0;

}