#include <bits/stdc++.h>

using namespace std;
#define ll long long
#define pii pair<int, int>
#define ld long double
#define all(a) (a).begin(), (a).end()

int MOD;

int add(int a, int b) {
    return a + b >= MOD ? a + b - MOD : a + b;
}

int sub(int a, int b) {
    return a >= b ? a - b : a + MOD - b;
}

int mul(int a, int b) {
    return (1ll * a * b) % MOD;
}

int pw(int x, int n) {
    int res = 1;
    while (n) {
        if (n % 2 == 0) {
            x = mul(x, x);
            n /= 2;
        } else {
            res = mul(res, x);
            n--;
        }
    }
    return res;
}

const int MAXF = 450;
int fact[MAXF], invf[MAXF];

int C(int n, int k) {
    return mul(fact[n], mul(invf[k], invf[n - k]));
}

int Cat(int n) {
    return mul(fact[2 * n], mul(invf[n], invf[n + 1]));
}

vector<int> operator*(vector<int> a, vector<int> b) {
    vector<int> c(a.size() + b.size() - 1);
    for (int i = 0; i < (int)a.size(); ++i) {
        for (int j = 0; j < (int)b.size(); ++j) {
            c[i + j] = add(c[i + j], mul(a[i], b[j]));
        }
    }
    return c;
}

vector<vector<int>> calc(vector<int> f, int n) {
    vector<vector<int>> dp(n + 1);
    dp[0].resize(n + 1);
    dp[0][0] = 1;
    for (int i = 1; i <= n; ++i) {
        dp[i].resize(n - i + 1);
        for (int j = 0; j <= n - i; ++j) {
            for (int k = 0; k <= j; ++k) {
                dp[i][j] = add(dp[i][j], mul(dp[i - 1][j - k], f[k]));
            }
        }
    }
    return dp;
}

signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int n;
    cin >> n >> MOD;

    fact[0] = 1;
    for (int i = 1; i < MAXF; ++i) {
        fact[i] = mul(fact[i - 1], i);
    }
    invf[MAXF - 1] = pw(fact[MAXF - 1], MOD - 2);
    for (int i = MAXF - 1; i > 0; --i) {
        invf[i - 1] = mul(invf[i], i);
    }

    vector<int> g(n + 1);
    for (int i = 0; i <= n; ++i) {
        for (int k = 0; k <= i; ++k) {
            g[i] = add(g[i], mul(C(2 * i, 2 * k), mul(Cat(k), Cat(i - k))));
        }
    }

    auto g2 = g * g;
    auto pwg = calc(g2, n);

    vector<int> c(n + 1);
    c[0] = 0;
    for (int i = 1; i <= n; ++i) {
        c[i] = g[i];
        for (int s = 1; s < i; ++s) {
            c[i] = sub(c[i], mul(2, mul(c[s], pwg[s][i - s])));
        }
        c[i] = mul(c[i], (MOD + 1) / 2);
    }

    vector<int> f = {1};
    for (int i = 1; i <= n; ++i) {
        vector<int> f2 = f * f;
        f2.resize(i + 1, 0);
        auto res = calc(f2, i);
        f.push_back(0);
        for (int s = 1; s <= i; ++s) {
            f[i] = add(f[i], mul(c[s], res[s][i - s]));
        }
    }
    for (int i = 1; i <= n; ++i) {
        cout << f[i] << "\n";
    }
    return 0;
}