n,M=map(int,input().split())
q=[[0]*(n*n+1) for i in range(n+1)]
q[1][0]=1
for p in range(2,2*n+1):
  nq=[[0]*(n*n+1) for i in range(n+1)]
  for i in range(n+1):
    for j in range(n*n+1):
      if q[i][j]!=0:
        c0=i
        c1=p-1-c0
        if c0>=c1>=0:
          if c0+1>=c1 and i+1<=n:
            nq[i+1][j+c1]+=q[i][j]
            nq[i+1][j+c1]%=M
          if c0>=c1+1:
            nq[i][j]+=q[i][j]
            nq[i][j]%=M
  q=nq
print(*q[n],sep="\n")