import sys

# sys.setrecursionlimit(200005)
int1 = lambda x: int(x)-1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
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 = 10**20
# md = 998244353
# md = 10**9+7


def nCr(com_n, com_r):
    if com_r < 0: return 0
    if com_n < com_r: return 0
    return fac[com_n]*ifac[com_r]%md*ifac[com_n-com_r]%md

def cnt_tree(n):
    if n==1:return 1
    return pow(n,n-2,md)

n,md=LI()

n_max = 400
fac = [1]
for i in range(1, n_max+1): fac.append(fac[-1]*i%md)
ifac = [1]*(n_max+1)
ifac[n_max] = pow(fac[n_max], md-2, md)
for i in range(n_max-1, 1, -1): ifac[i] = ifac[i+1]*(i+1)%md

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

for i in range(n):
    for j in range(n):
        pre=dp[i][j]
        if pre==0:continue
        for ni in range(i+1,n+1):
            m=ni-i
            dp[ni][j+m-1]+=nCr(n-i-1,m-1)*pre%md*cnt_tree(m)%md
            # print(m,nCr(n-i,m-1),pre,cnt_tree(m))
            dp[ni][j+m-1]%=md
    # p2D(dp)
    # print()

for j in range(n):
    print(dp[n][j])