#include <bits/stdc++.h>
using namespace std;

#define rep(i, f, n) for (int i = (f); i < (n); i++)
#define rrep(i, f, n) for (int i = int(n) - 1; i >= f; i--)
typedef long long ll;
typedef pair<int, int> P;

template <typename T, typename U>
auto Sum(T a, U b) -> decltype(a + b)
{
    return a + b;
}

template <typename T, typename U>
inline bool amax(T &a, U b)
{
    if (b > a)
    {
        a = b;
        return true;
    }
    return false;
}
template <typename T, typename U>
inline bool amin(T &a, U b)
{
    if (b < a)
    {
        a = b;
        return true;
    }
    return false;
}

int dp[101][101][11001] = {};

int main()
{
    int N, M;
    cin >> N >> M;

    rep(i, 0, N + 1) dp[0][i][0] = 1;

    rep(i, 1, N + 1) rep(j, 0, N + 1) rep(k, 0, N * N + 1)
    {
        if (0 < j)
            dp[i][j][k] += dp[i][j - 1][k];
        if (j < i && j <= k)
            dp[i][j][k] += dp[i - 1][j][k - j];
        dp[i][j][k] %= M;
    }
    rep(i, 0, N * N + 1) cout << dp[N][N][i] << endl;
}