#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define each(e, v) for(auto &e: v)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) (int)x.size()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
const int MOD = 1000000007;
//const int MOD = 998244353;
const int inf = (1<<30)-1;
const ll INF = (1LL<<60)-1;
template<typename T> bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;};
template<typename T> bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;};

struct io_setup{
    io_setup(){
        ios_base::sync_with_stdio(false);
        cin.tie(NULL);
        cout << fixed << setprecision(15);
    }
} io_setup;

int main(){
    int N; ll M; cin >> N >> M;

    vector<vector<ll>> dp(N+1, vector<ll>(N*N+1, 0));
    dp[0][0] = 1;

    rep(i, 2*N){
        vector<vector<ll>> tmp(N+1, vector<ll>(N*N+1, 0));

        rep(j, N+1){
            rep(k, N*N+1){
                if(dp[j][k] == 0) continue;
                if(j > 0) tmp[j-1][k] += dp[j][k], tmp[j-1][k] %= M;
                if(j < N) tmp[j+1][k+(i-j)/2] += dp[j][k], tmp[j+1][k+(i-j)/2] %= M;
            }
        }

        swap(dp, tmp);
    }

    rep(i, N*N+1){
        cout << dp[0][i] << '\n';
    }
}