#include <iostream>
#include <string>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <iterator>
#include <cassert>
#include <numeric>
#include <functional>
#include <ctime>
#pragma warning(disable:4996) 

#define ATCODER
#ifdef ATCODER
#include <atcoder/all>
#endif

typedef long long ll;
typedef unsigned long long ull;
#define LINF  9223300000000000000
#define LINF2 1223300000000000000
#define LINF3 1000000000000
#define INF 2140000000
//const long long MOD = 1000000007;
//const long long MOD = 998244353;

using namespace std;
#ifdef ATCODER
using namespace atcoder;
#endif

ll dp[2][205][10005];

void solve()
{
    int n; ll M;
    scanf("%d%lld", &n, &M);
    int pre = 0, cur = 1;
    dp[0][0][0] = 1;
    for (int i = 0; i < n * 2; i++) {
        for (int j = 0; j <= n; j++) {
            for (int k = 0; k <= n * n; k++) {
                dp[cur][j][k] = 0;
            }
        }
        for (int j = 0; j <= n; j++) {
            for (int k = 0; k <= n * n; k++) {
                if (dp[pre][j][k] == 0) continue;

                if (i - j + 1 <= n) {
                    int k2 = k + j;
                    dp[cur][j][k2] = (dp[cur][j][k2] + dp[pre][j][k]) % M;
                }
                if (j + 1 <= i - j) {
                    int k2 = k;
                    dp[cur][j+1][k2] = (dp[cur][j+1][k2] + dp[pre][j][k]) % M;
                }
            }
        }
        swap(pre, cur);
    }

    for (int k = 0; k <= n * n; k++) {
        ll ans = 0;
        for (int j = 0; j <= n; j++) {            
            ans = (ans + dp[pre][j][k]) % M;            
        }
        printf("%lld\n", ans);
    }          

    return;
}


int main()
{
#if 1
    solve();
#else
    int T, t;
    scanf("%d", &T);
    for (t = 0; t < T; t++) {
        //cout << "Case #" << t + 1 << ": ";
        solve();
    }
#endif
    return 0;
}