n,mod=map(int,input().split())
M=(10**5)*3+1 
fac=[1]*M
ninv=[1]*M
finv=[1]*M
for i in range(2,M):
  fac[i]=fac[i-1]*i%mod
  ninv[i]=(-(mod//i)*ninv[mod%i])%mod
  finv[i]=finv[i-1]*ninv[i]%mod

def binom(n,k):
  if n<0 or k<0:
    return 0
  if k>n:
    return 0
  return (fac[n]*finv[k]%mod)*finv[n-k]%mod

def fpow(x,k):
  print(x,k)
  res=1
  while k:
    if k&1:
      res=res*x%mod
    x=x*x%mod
    k>>=1
  return res

cnt=[0]*(n+1)
for i in range(1,n+1):
  if i==1:
    cnt[i]=1
  else:
    cnt[i]=fpow(i,i-2)

dp=[[0]*(n+1) for i in range(n+1)]
dp[0][0]=1
for i in range(n):
  for j in range(i+1):
    for k in range(1,n+1):
      if i+k<=n:
        dp[i+k][j+k-1]+=binom(n-i-1,k-1)*dp[i][j]%mod*cnt[k]
        dp[i+k][j+k-1]%=mod

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