n, MOD = map(int, input().split())

fact = [1] * (n + 1)
for i in range(1, n + 1):
    fact[i] = fact[i - 1] * i % MOD

inv_fact = [1] * (n + 1)
inv_fact[n] = pow(fact[n], MOD - 2, MOD)
for i in range(n - 1, -1, -1):
    inv_fact[i] = inv_fact[i + 1] * (i + 1) % MOD

t = [0] * (n + 1)
for s in range(1, n + 1):
    if s == 1:
        t[s] = 1
    else:
        t[s] = pow(s, s - 2, MOD)

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

for l in range(1, n + 1):
    for m in range(n + 1):
        if dp[m][l - 1] == 0:
            continue
        for s in range(1, n - m + 1):
            new_m = m + s
            term = dp[m][l - 1] * t[s] % MOD
            term = term * inv_fact[s] % MOD
            dp[new_m][l] = (dp[new_m][l] + term) % MOD

ans = [0] * n
for k in range(1, n + 1):
    M = n - k
    if 0 <= M < n:
        res = fact[n] * inv_fact[k] % MOD
        res = res * dp[n][k] % MOD
        ans[M] = res

for a in ans:
    print(a)