n,mod=map(int,input().split())
dp=[[0]*(n**2+1) for i in range(n+1)]
dp[0][0]=1
for i in range(n+1):
    dp2=[[0]*(n**2+1) for i in range(n+1)]
    for j in range(i+1):
        for l in range(n**2+1):
            if not dp[j][l]:
                continue
            if i-j:
                dp[j+1][l]+=dp[j][l];dp[j+1][l]%=mod
            if i<n:
                dp2[j][l+j]+=dp[j][l];dp[j][l+j]%=mod
    if i!=n:
    	dp=dp2
for i in range(n**2+1):
    print(dp[n][i])