N, mod = map(int, input().split())

# dp[i桁目まで決定、0がj回出現, 転倒数k] -> 何通り
dp = [[[0]*(N*N+1) for _ in range(N+1)] for _ in range(2*N+1)]
dp[0][0][0] = 1
for i in range(2*N):
    for j in range(N+1):
        c0 = j
        c1 = i - j
        if c0 < c1:
            continue
        if c1 < 0:
            break
        for k in range(N*N+1):
            # 0追加する
            if c0 + 1 <= N and k + c1 <= N*N:
                dp[i+1][c0+1][k+c1] += dp[i][j][k]
                dp[i+1][c0+1][k+c1] %= mod
            # 1追加
            if c1 + 1 <= N and c0 >= c1 + 1:
                dp[i+1][c0][k] += dp[i][j][k]
                dp[i+1][c0][k] %= mod

for i in range(N*N+1):
    print(dp[2*N][N][i])