def main():
    import sys
    input = sys.stdin.readline

    def f(x, mod):
        if x == 1:
            return 1
        return pow(x, x-2, mod)

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

    # comb init
    # mod = 1000000007
    nmax = 2 * 10 ** 5 + 10  # change here
    fac = [0] * nmax
    finv = [0] * nmax
    inv = [0] * nmax
    fac[0] = 1
    fac[1] = 1
    finv[0] = 1
    finv[1] = 1
    inv[1] = 1
    for i in range(2, nmax):
        fac[i] = fac[i - 1] * i % mod
        inv[i] = mod - inv[mod % i] * (mod // i) % mod
        finv[i] = finv[i - 1] * inv[i] % mod

    def comb(n, r):
        if n < r:
            return 0
        else:
            return (fac[n] * ((finv[r] * finv[n - r]) % mod)) % mod

    dp = [[0] * N for _ in range(N+1)]
    dp[N][0] = 1
    for i in range(N, 0, -1):
        for j in range(N):
            for j_use in range(1, N):
                if j + j_use < N and i >= j_use + 1:
                    dp[i-(j_use + 1)][j + j_use] = (dp[i-(j_use + 1)][j + j_use] + ((dp[i][j] * f(j_use + 1, mod))%mod * comb(i-1, j_use))%mod)%mod
            dp[i-1][j] = (dp[i-1][j] + dp[i][j])%mod

    print(*dp[0], sep="\n")


if __name__ == '__main__':
    main()