// Template
#include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>
#include <iomanip>
#include <tuple>
#include <utility>
#include <queue>
#include <set>
#include <map>
#include <array>
#include <cassert>
#include <cmath>
#define rep_override(x, y, z, name, ...) name
#define rep2(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep3(i, l, r) for (int i = (int)(l); i < (int)(r); ++i)
#define rep(...) rep_override(__VA_ARGS__, rep3, rep2)(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
constexpr int inf = 1001001001;
constexpr ll infll = 3003003003003003003LL;
template <typename T>
inline bool chmin(T &x, const T &y) {
    if (x > y) {
        x = y;
        return true;
    }
    return false;
}
template <typename T> 
inline bool chmax(T &x, const T &y) {
    if (x < y) {
        x = y;
        return true;
    }
    return false;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &vec) {
    for (T &element : vec) is >> element;
    return is;
}
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &vec) {
    for (int i = 0, vec_len = (int)vec.size(); i < vec_len; ++i) {
        os << vec[i] << (i + 1 == vec_len ? "" : " ");
    }
    return os;
}
struct IOSET {
    IOSET() {
        cin.tie(nullptr);
        ios::sync_with_stdio(false);
        cout << fixed << setprecision(10);
    }
} ioset;

// Main
int dp[201][101][10001];

int main() {
    int n, m;
    cin >> n >> m;
    
    dp[0][0][0] = 1;
    rep(i, 2 * n) rep(j, n + 1) rep(k, n * n + 1) {
        if (i < j || (i - j) % 2) continue;
        int l = (i - j) / 2; // 1
        if (j != n && k + l <= n * n) {
            dp[i + 1][j + 1][k + l] += dp[i][j][k];
            if (dp[i + 1][j + 1][k + l] >= m) dp[i + 1][j + 1][k + l] -= m;
        }
        if (j != 0) {
            dp[i + 1][j - 1][k] += dp[i][j][k];
            if (dp[i + 1][j - 1][k] >= m) dp[i + 1][j - 1][k] -= m;
        }
    }
    
    rep(i, n * n + 1) {
        cout << dp[2 * n][0][i] << '\n';
    }
}