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

ans = 1
# dp(_,f,g) <==> pd[2f+g]
pd = [1, 0, 0, 0]
for x in range(2 * N - 3):
    # pd: dp(x,*,*), dp: dp(x+1,*,*)
    dp = [0, 0, 0, 0]
    for f in (0, 1):
        # T: tofu, R: red ball, W: white ball

        # g=0 (RTRT...RT)
        val = pd[2 * f]
        ## put W
        dp[0b00] += val
        ## put R
        dp[0b11] += val

        # g=1 (RTRT...TR)
        val = pd[2 * f + 1]
        ## put W
        dp[0b01] += val
        ## put TR
        weight_red = 1 if f else x # if f==0 then vertex (x,_) has degree of 1
        dp[0b11] += val * weight_red
        ## put TW
        weight_white = weight_red * (x + 1) % M # vertex (x+1,_) has degree of 1
        dp[0b00] += val * weight_white

    for i in range(4):
        pd[i] = dp[i] % M

    if x % 2 == 0:
        # level x/2+1
        ans = ans * (pd[1] + pd[3]) % M

# level N
for x in range(1, 2 * N):
    ans = ans * x % M
print(ans)