#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
#define rep(i,n)for (int i = 0; i < int(n); ++i)
#define rrep(i,n)for (int i = int(n)-1; i >= 0; --i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
template<class T> void chmax(T& a, const T& b) {a = max(a, b);}
template<class T> void chmin(T& a, const T& b) {a = min(a, b);}
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;
using mint = modint;
mint dp[101][10001];
mint ndp[101][10001];

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n, m;
    cin >> n >> m;
    mint::set_mod(m);
    dp[0][0] = 1;
    rep(i, 2 * n) {
        rep(j, n + 1) rep(k, n * n + 1) ndp[j][k] = mint::raw(0);
        rep(j, n + 1) rep(k, n * n + 1) if (dp[j][k].val()) {
            int rcnt = (i - j) / 2;
            if (j + 1 <= n && k + rcnt <= n * n) ndp[j + 1][k + rcnt] += dp[j][k];
            if (j - 1 >= 0) ndp[j - 1][k] += dp[j][k];
        }
        rep(j, n + 1) rep(k, n * n + 1) dp[j][k] = ndp[j][k];
    }
    rep(k, n * n + 1) cout << dp[0][k].val() << '\n';
}