#include <bits/stdc++.h>
using namespace std;
int main(){
  int N, M;
  cin >> N >> M;
  vector<vector<vector<long long>>> dp(N + 1, vector<vector<long long>>(N + 1, vector<long long>(N * N + 1, 0)));
  dp[0][0][0] = 1;
  for (int i = 0; i <= N; i++){
    for (int j = 0; j <= N; j++){
      for (int k = 0; k <= N * N; k++){
        if (dp[i][j][k] > 0){
          if (i < N){
            dp[i + 1][j][k + j] += dp[i][j][k];
            dp[i + 1][j][k + j] %= M;
          }
          if (j < i){
            dp[i][j + 1][k] += dp[i][j][k];
            dp[i][j + 1][k] %= M;
          }
        }
      }
    }
  }
  for (int i = 0; i <= N * N; i++){
    cout << dp[N][N][i] << endl;
  }
}