N,mod=map(int,input().split())
K=N
def cmb(n,r):
  if r<0 or r>n:
    return 0
  return (g1[n]*g2[r]*g2[n-r])%mod
 
N=300000
g1=[1]*(N+3)
for i in range(2,N+3):
  g1[i]=g1[i-1]*i%mod
g2=[0]*len(g1)
g2[-1]=pow(g1[-1],mod-2,mod)
for i in range(N+1,-1,-1):
  g2[i]=g2[i+1]*(i+1)%mod
inv=[0]*(N+3)
for i in range(1,N+3):
  inv[i]=g2[i]*g1[i-1]%mod

N=K
DP=[[0]*(N+1) for i in range(N+1)]
V=[0]*(N+1)
V[1]=1
for i in range(2,N+1):
  V[i]=pow(i,i-2,mod)
DP[0][0]=1
for i in range(N):
  for j in range(N):
    if DP[i][j]==0:
      continue
    for k in range(i+1,N+1):
      DP[k][j+k-i-1]=(DP[k][j+k-i-1]+DP[i][j]*cmb(N-i-1,k-i-1)*V[k-i])%mod
print(*DP[N][:N],sep='\n')