import numpy as np
N,MOD = map(int,input().split())
#dp[i][j][k]: 0がi個、1がj個、転倒数がk個
dp = np.zeros((2*N+1,2*N+1,N*N+1), np.int64)
dp[0,0,0] = 1
#print(dp)
for i in range(2*N+1):
  for j in range(2*N+1):
    for k in range(N*N+1):
      if i >= j: #i<jなら0
        if i+1 <= 2*N and k+j < N*N: #0を追加
          dp[i+1,j,k+j] += dp[i,j,k]
          dp[i+1,j,k+j] %= MOD
        if j+1 <= 2*N: #1を追加
          dp[i,j+1,k] += dp[i,j,k]
          dp[i,j+1,k] %= MOD
#print(dp)
print(*dp[N,N],sep="\n")