def search(one, zero, k, s):
    global D, N
    if zero == N:
        D[k] += 1
        return
    if zero > one:
        search(one+1, zero, k, s+'1')
    search(one, zero+1, k + one, s+'0')

N, M = map(int, input().split())

D = [0] * (N**2+1)

search(0, 0, 0, '')

for i in range(N**2+1):
    print(D[i] % M)