#include <bits/stdc++.h>
#include <atcoder/modint>
using namespace atcoder;
//#pragma GCC optimize("Ofast")
using namespace std;
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)
#define Rrep(i,n) Rreps(i,n,0)
#define ALL(a) a.begin(), a.end()

using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;

ll N,M,H,W,Q,K,A,B;
string S;
using P = pair<ll, ll>;
using tp = tuple<ll, ll, ll>;
const ll INF = (1LL<<61);

template<class T> bool chmin(T &a, const T b){
    if(a > b) {a = b; return true;}
    else return false;
}
template<class T> bool chmax(T &a, const T b){
    if(a < b) {a = b; return true;}
    else return false;
}
template<class T> void my_printv(std::vector<T> v,bool endline = true){
    if(!v.empty()){
        for(std::size_t i{}; i<v.size()-1; ++i) std::cout<<v[i]<<" ";
        std::cout<<v.back();
    }
    if(endline) std::cout<<std::endl;
}

using mint = modint;

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cin>>N>>M;
    mint::set_mod(M);
    vector<vector<mint> >  dp(N + 1, vector<mint>(N * (N - 1) / 2 + 1, 0));
    dp[0][0] = 1;
    rep(i, N){
        vector<vector<mint> > ndp(N + 1, vector<mint>(N * (N - 1) / 2 + 1, 0));
        rep(j, i + 1){
            rep(k, N * (N - 1) / 2 + 1){
                ndp[j][k + j] += dp[j][k];
            }
        }
        dp = ndp;
        rep(j, i + 1) rep(k, N * (N - 1) / 2 + 1) dp[j + 1][k] += dp[j][k];
    }
    rep(i, N * N){
        if(i <= N * (N - 1) / 2) cout<<dp[N][i].val()<<endl;
        else cout<<0<<endl;
    }
}