#include <cstdio>
#include <cstring>
#include <algorithm>
#include <utility>
#include <vector>
#include <array>
#define FILEIO(filename) (freopen(filename ".in", "r", stdin), freopen(filename ".out", "w", stdout))
typedef long long ll;
typedef unsigned long long ull;
using std::pair, std::vector, std::array;
const int N = 505, M = 12;
int n, mod;
int inv[N];
int f[N][M][4], g[N][M], h[N][M];
inline void update(int &x, ll y)
{
    x = (x + y) % mod;
}
int ans[M];
int main(void)
{
    scanf("%d%d", &n, &mod);
    inv[1] = 1;
    for (int i = 2; i <= n;++i)
        inv[i] = (ll)(mod - mod / i) * inv[mod % i] % mod;
    f[0][0][3] = 1;
    for (int k = 1; k <= 10;++k)
    {
        for (int i = 0; i <= n;++i)
            for (int c = 0; c <= 3;++c)
                update(f[i][k][0], f[i][k - 1][c]);
        for (int i = 1; i <= n;++i)
        {
            g[i][k] = ((ll)f[i - 1][k][1] + f[i - 1][k - 1][2] + f[i - 1][k - 1][3]) % mod;
            if(2 * i < n)
            {
                for (int j = n; j >= i;--j)
                    for (int l = 1, cur = 1; j - i * l >= 0;++l)
                    {
                        cur = (ll)cur * (g[i][k] + l - 1) % mod * inv[l] % mod;
                        for (int c = 0; c <= 3;++c)
                            update(f[j][k][std::min(c + l, 3)], (ll)cur * f[j - i * l][k][c]);
                    }
            }
        }
    }
    for (int k = 1; k <= 10;++k)
    {
        memset(h, 0, sizeof(h));
        for (int i = 1; i <= n;++i)
        {
            update(h[i][k - 1], f[i - 1][k][2]);
            for (int j = 0; j < k;++j)
                for (int l = 1; l < i && l * 2 < n;++l)
                {
                    update(h[i][j], (ll)f[i - l - 1][j + 1][1] * h[l][j + 1]);
                    update(h[i][j], (ll)f[i - l - 1][j][0] * h[l][j]);
                }
        }
        for (int i = 1; i <= k; ++i)
            update(ans[k], g[n][i]);
        for (int i = 0; i < k;++i)
            update(ans[k], h[n][i]);
        if(!(n & 1))
        {
            int sum = 0;
            for (int i = 1; i <= k;++i)
                update(sum, g[n / 2][i]);
            update(ans[k], (ll)sum * (sum + 1) / 2);
            sum = 0;
            for (int i = 0; i < k;++i)
            {
                update(sum, g[n / 2][i]);
                update(ans[k], (ll)sum * h[n / 2][i]);
            }
        }
    }
    for (int k = 10; k >= 1;--k)
        update(ans[k], mod - ans[k - 1]);
    for (int i = 1; i <= std::min(n, 10); ++i)
        printf("%d ", ans[i]);
    for (int i = std::min(n, 10) + 1; i <= n;++i)
        printf("0 ");
    putchar('\n');
    return 0;
}