import sys
from itertools import permutations
from heapq import heappop,heappush
from collections import deque
import random
import bisect

input = lambda :sys.stdin.readline().rstrip()
mi = lambda :map(int,input().split())
li = lambda :list(mi())

N,M = mi()

"""
状態:自分からみて埋まっていない最小値が(-1,0,1)の状態
"""

res = 1
dp = [1,1,1]
for i in range(N-2):
    for j in range(2):
        ndp = [0,0,0]
        x = 2 * (i+1) + j
        for mini in (-1,0,1):
            for nxt_mini in (-1,0,1):
                if mini > nxt_mini+1:
                    continue
                deg = nxt_mini - mini + 1
                if deg == 0:
                    ndp[nxt_mini] += dp[mini] * x % M
                else:
                    ndp[nxt_mini] += dp[mini] % M
                ndp[nxt_mini] %= M
        dp = ndp
        #print(dp)
    res *= dp[1]
    res %= M

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

print(res)