#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#include <list>
#include <atcoder/all>
#define popcount __builtin_popcount
using namespace std;
using namespace atcoder;
typedef long long ll;
typedef pair<int, int> P;
int m;
int n;
int dp[202][101][10001];
int main()
{
    cin>>n>>m;
    dp[0][0][0]=1;
    for(int i=0; i<2*n; i++){
        for(int j=0; j<=i/2; j++){
            int x=i-j, y=j;
            for(int k=0; k<=(i/2)*((i+1)/2); k++){
                if(x+1>=y && k+y<=10000){
                    dp[i+1][j][k+y]+=dp[i][j][k];
                    dp[i+1][j][k+y]%=m;
                }
                if(x>=y+1){
                    dp[i+1][j+1][k]+=dp[i][j][k];
                    dp[i+1][j+1][k]%=m;
                }
            }
        }
    }
    for(int k=0; k<=n*n; k++){
        cout<<dp[2*n][n][k]<<endl;
    }
    return 0;
}