#pragma region Macros

#include <bits/extc++.h>
using namespace std;
using namespace __gnu_pbds;
// using namespace __gnu_cxx;
// #include <atcoder/maxflow>
// using namespace atcoder;

// #include <boost/multiprecision/cpp_int.hpp>
// namespace mp = boost::multiprecision;
// using Bint = mp::cpp_int;

#define TO_STRING(var) # var
#define pb emplace_back
#define int ll
#define endl '\n'

using ll = long long;
using ld = long double;
const ld PI = acos(-1);
const ld EPS = 1e-10;
const int INF = 1 << 30;
const ll INFL = 1LL << 61;
// const int MOD = 998244353;
const int MOD = 1000000007;

__attribute__((constructor))
void constructor() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    // ifstream in("input.txt");
    // cin.rdbuf(in.rdbuf());
    cout << fixed << setprecision(15);
}

template<int mod> class modint{
public:
    int val = 0;
    modint(int x = 0) { while (x < 0) x += mod; val = x % mod; }
    modint(const modint &r) { val = r.val; }

    modint operator -() { return modint(-val); }
    modint operator +(const modint &r) { return modint(*this) += r; }
    modint operator -(const modint &r) { return modint(*this) -= r; }
    modint operator *(const modint &r) { return modint(*this) *= r; }
    modint operator /(const modint &r) { return modint(*this) /= r; }

    modint &operator +=(const modint &r) {
        val += r.val;
        if (val >= mod) val -= mod;
        return *this;
    }
    modint &operator -=(const modint &r) {
        if (val < r.val) val += mod;
        val -= r.val;
        return *this;
    }
    modint &operator *=(const modint &r) {
        val = val * r.val % mod;
        return *this;
    }
    modint &operator /=(const modint &r) {
        int a = r.val, b = mod, u = 1, v = 0;
        while (b) {
            int t = a / b;
            a -= t * b; swap(a, b);
            u -= t * v; swap(u, v);
        }
        val = val * u % mod;
        if (val < 0) val += mod;
        return *this;
    }

    bool operator ==(const modint& r) { return this -> val == r.val; }
    bool operator <(const modint& r) { return this -> val < r.val; }
    bool operator !=(const modint& r) { return this -> val != r.val; }
};

using mint = modint<MOD>;

istream &operator >>(istream &is, mint& x) {
    int t; is >> t;
    x = t;
    return (is);
}
ostream &operator <<(ostream &os, const mint& x) {
    return os << x.val;
}

mint modpow(const mint &a, int N) {
    if (N == 0) return 1;
    mint t = modpow(a, N / 2);
    t = t * t;
    if (N & 1) t = t * a;
    return t;
}

int modpow(int x, int N, int mod) {
    int ret = 1;
    while (N > 0) {
        if (N % 2 == 1) ret = ret * x % mod;
        x = x * x % mod;
        N /= 2;
    }
    return ret;
}

int ceil(int x, int y) { return (x > 0 ? (x + y - 1) / y : x / y); }

#pragma endregion

signed main() {
    int N, M;
    cin >> N >> M;

    vector<vector<vector<int>>> dp(2 * N + 1, vector<vector<int>>(N + 1, vector<int>(N * N + 1)));
    dp[0][0][0] = 1;
    for (int i = 0; i < 2 * N; i++) { // 長さiの01列であって
        for (int j = (i + 1) / 2; j <= min(i, N); j++) { // 0の個数がj個で
            for (int k = 0; k < N * N; k++) { // 転倒数がk
                // 末尾に1を付け足しても転倒数は変わらない
                dp[i + 1][j][k] += dp[i][j][k];
                dp[i + 1][j][k] %= M;

                if (k + i - j < 0 or k + i - j > N * N or j == N) continue;
                // (i - j)は1の個数.末尾に0を付け足すと1の個数分だけ転倒数が増える
                dp[i + 1][j + 1][k + i - j] += dp[i][j][k];
                dp[i + 1][j + 1][k + i - j] %= M;
            }
        }
    }
    
    for (int i = 0; i <= N * N; i++) {
        cout << dp[2 * N][N][i] << endl;
    }
}