import sys

# sys.setrecursionlimit(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

# dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = (1 << 63)-1
# inf = (1 << 31)-1
# md = 10**9+7
md = 998244353

n, m = LI()
dp = [[0]*(n**2+1) for _ in range(n+1)]
ndp = [[0]*(n**2+1) for _ in range(n+1)]
ndp[0][0] = 1

for i in range(n+1):
    for j in range(i, n+1):
        if i == j == 0: continue
        for k in range(n**2+1):
            v = 0
            if j-1 >= i and k-i >= 0: v += ndp[j-1][k-i]
            if i: v += dp[j][k]
            ndp[j][k] = v%m
    dp, ndp = ndp, dp
    # p2D(dp)

for k in range(n**2+1):
    print(dp[n][k])