import sys

sys.setrecursionlimit(10**7)
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return map(int,sys.stdin.readline().rstrip().split())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LI2(): return list(map(int,sys.stdin.readline().rstrip()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())
def LS2(): return list(sys.stdin.readline().rstrip())


N,M = MI()

dp = [[[0]*(i**2//4+1) for _ in range(i//2+1)] for i in range(2*N+1)]
# dp[i][j][k] = iまで見て1がj個現れて転倒数がkである文字列の個数
dp[0][0][0] = 1
for i in range(2*N):
    for j in range(i//2+1):
        for k in range(i**2//4+1):
            a = dp[i][j][k]
            dp[i+1][j][k+j] += a
            dp[i+1][j][k+j] %= M
            if j+1 <= (i+1)//2:
                dp[i+1][j+1][k] += a
                dp[i+1][j+1][k] %= M

ANS = dp[-1][-1]
print(*ANS,sep='\n')