import times, strutils, sequtils, math, algorithm, tables, sets, lists, intsets
import critbits, future, strformat, deques
template `max=`(x,y) = x = max(x,y)
template `min=`(x,y) = x = min(x,y)
template `mod=`(x,y) = x = x mod y
template scan2 = (scan(), scan())
template scan3 = (scan(), scan())
let read* = iterator: string {.closure.} =
    while true: (for s in stdin.readLine.split: yield s)
proc scan(): int = read().parseInt
proc scanf(): float = read().parseFloat
proc toInt(c:char): int =
    return int(c) - int('0')


proc isGood(s:string):bool=
  if s.len==0:
    return true
  else:
    for i in 0..<s.len-1:
      if s[i..i+1]=="01":
        return isGood(s[0..<i]&s[i+2..<s.len])
    return false

proc tentou(s:string):int=
  var oneC = 0
  for c in s:
    if c=='1':
      oneC+=1
    else:
      result+=oneC


#var n = 4
#var s = newseqwith(n*2,1)
#var cnt = 0
#var cases = 1
#for i in 0..<n:
##  s[i]=0
#cnt+=s.join("").isGood().int
#echo s.join("")," : " , s.join("").isGood(), " : ", s.join("").tentou
#while s.nextPermutation:
  #echo s.join("")," : " , s.join("").isGood(), " : ", s.join("").tentou
  #cases+=1
  #cnt+=s.join("").isGood().int
#echo "==="
#echo cnt , " / ", cases


proc solve()=
  var
    n = scan()
    m = scan()
    dp = newseqwith(2,newseqwith(n+1,newseqwith(n^2+1,0)))
  dp[0][0][0]=1
  for i in 1..n*2:
    var now = i mod 2
    var prev = (i+1) mod 2 
    for j in 0..n:
      for k in 0..n^2:
        dp[now][j][k]=0
        if k-j>=0:
          dp[now][j][k]+=dp[prev][j][k-j]
        if i-j >= j and j-1>=0:
          dp[now][j][k]+=dp[prev][j-1][k]
        dp[now][j][k].mod=m
    #echo dp[now]
  for t in 0..n^2:
    echo dp[0][n][t]

solve()