#include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <tuple>
#include <utility>
#include <vector>

#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
using namespace std;
using ll = long long int;
using P = pair<ll, ll>;

// clang-format off
#ifdef _DEBUG_
#define dump(...) do{ cerr << __LINE__ << ":\t" << #__VA_ARGS__ << " = "; debug_print(__VA_ARGS__); } while(false)
template<typename T, typename... Ts> void debug_print(const T &t, const Ts &...ts) { cerr << t; ((cerr << ", " << ts), ...); cerr << endl; }
#else
#define dump(...) do{ } while(false)
#endif
template<typename T> vector<T> make_v(size_t a, T b) { return vector<T>(a, b); }
template<typename... Ts> auto make_v(size_t a, Ts... ts) { return vector<decltype(make_v(ts...))>(a, make_v(ts...)); }
template<typename T> bool chmin(T &a, const T& b) { if (a > b) {a = b; return true; } return false; }
template<typename T> bool chmax(T &a, const T& b) { if (a < b) {a = b; return true; } return false; }
template<typename T, typename... Ts> void print(const T& t, const Ts&... ts) { cout << t; ((cout << ' ' << ts), ...); cout << '\n'; }
template<typename... Ts> void input(Ts&... ts) { (cin >> ... >> ts); }
template<typename T> istream &operator,(istream &in, T &t) { return in >> t; }
// clang-format on

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n, m;
    cin, n, m;
    auto dp = make_v(n + 1, n + 1, n * n + 1, 0);
    dp[0][0][0] = 1;
    rep(x, 0, n + 1) {
        rep(y, 0, x + 1) {
            rep(k, 0, n * n + 1) {
                // zero
                if (x + 1 <= n && k + y <= n * n) {
                    dp[x + 1][y][k + y] += dp[x][y][k];
                    dp[x + 1][y][k + y] %= m;
                }
                // one
                if (y < x) {
                    dp[x][y + 1][k] += dp[x][y][k];
                    dp[x][y + 1][k] %= m;
                }
            }
        }
    }
    rep(i, 0, n * n + 1) {
        print(dp[n][n][i]);
    }
    return 0;
}