#include<bits/stdc++.h>
using namespace std;
//#define int long long
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define all(a) a.begin(),a.end()
#define rall(c) (c).rbegin(),(c).rend()
#define mp make_pair
#define endl '\n'
#define vec vector<ll>
#define mat vector<vector<ll> >
#define fi first
#define se second
#define double long double
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> pll;
//typedef long double ld;
typedef complex<double> Complex;
const ll INF=1e9+7;
const ll MOD=INF;
const ll inf=INF*INF;
ll mod=MOD;
const ll MAX=100010;



signed main(){
    ll n,m;cin>>n>>m;
    vector<vector<int> >dp(n+1,vector<int>(n*n+1));
    vector<vector<int> >dp1(n+1,vector<int>(n*n+1));
    dp[0][0]=1;
    rep(i,2*n){
        rep(j,n+1){
            rep(k,n*n+1){
                if(i-j<j)continue;
                if(j<n){
                    dp1[j+1][k]=(dp1[j+1][k]+dp[j][k])%m;
                }
                if(k+j<=n*n)dp1[j][k+j]=(dp1[j][k+j]+dp[j][k])%m;
            }
        }
        swap(dp,dp1);
        rep(j,n+1){
            rep(k,n*n+1){
                dp1[j][k]=0;
            }
        }
    }
    rep(i,n*n+1){
        cout<<dp[n][i]<<endl;
    }
}