/**
 *   @FileName	a.cpp
 *   @Author	kanpurin
 *   @Created	2021.05.01 05:02:12
**/

#include "bits/stdc++.h" 
using namespace std; 
typedef long long ll;

int main() {
    int n,m;cin >> n >> m;
    vector<vector<ll>> dp(n+1,vector<ll>(n*n+1));
    
    dp[0][0] = 1;
    
    for (int i = 0; i <= n; i++) {
        vector<vector<ll>> dp2(n+1,vector<ll>(n*n+1));
        for (int j = 0; j <= i; j++) {
            if (j <= i+1 && i+1 <= n) for (int k = 0; k+j <= n*n; k++) {
                
                
                dp2[j][k+j] += dp[j][k];
                dp2[j][k+j] %= m;
            }
            if (i >= j+1) for (int k = 0; k <= n*n; k++) {
                
                
                dp[j+1][k] += dp[j][k];
                dp[j+1][k] %= m;
            }
        }
        if(i < n) dp = dp2;
    }
    for (int k = 0; k <= n*n; k++) {
        cout << dp[n][k] << endl;
    }
    return 0;
}