#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int MAXN=40005;
int n,MOD,dp[2][MAXN][3],f[MAXN][3],g[MAXN][3];
ll fac[MAXN],ifac[MAXN];
/*
 * dp[i,j,k]: 1~i, now j free bracket for OPT,
 * k=0: |FAKE|=|OPT|, FAKE no free bracket
 * k=1: |FAKE|=|OPT|, FAKE have free bracket
 * K=2: |FAKE|=|OPT|-1, FAKE have free bracket
 * f[j,k]: have j useless free bracket
 * g[i,k]: dp[i,0,k] += g[i,k] (deal with useless bracket in f[])
 */
void add(int &x,int y) { x=(x+y>=MOD)?x+y-MOD:x+y; }
void addl(int &x,ll y) { x=(x+y)%MOD; }
ll ksm(ll a,int b=MOD-2,int p=MOD) {
	ll ret=1;
	for(;b;a=a*a%p,b=b>>1) if(b&1) ret=ret*a%p;
	return ret;
}
ll C(int x,int y) { return fac[x]*ifac[x-y]%MOD; } //x place y
signed main() {
	scanf("%d%d",&n,&MOD),n<<=1;
	for(int i=fac[0]=ifac[0]=1;i<=n;++i) ifac[i]=ksm(fac[i]=i*fac[i-1]%MOD);
	dp[0][0][0]=1;
	for(int i=0;i<n;++i) {
		int cur=i&1,J=min(i,n-i);
		auto &F=dp[cur^1],&G=dp[cur];
		for(int j=0;j<=J;++j) { //left bracket
			if(G[j][0]) add(F[j+1][1],G[j][0]);
			if(G[j][1]) add(F[j+1][1],G[j][1]);
			if(G[j][2]) add(F[j+1][2],G[j][2]);
		}
		for(int j=0;j<=J;++j) { //right bracket
			if(G[j][1]) {
				if(j>0) add(f[j-1][0],G[j][1]);
					//match with FAKE's bracket
				if(j>1) addl(f[j-2][2],1ll*(j-1)*G[j][1]);
					//match other bracket
			}
			if(G[j][2]) add(F[j][0],G[j][2]); //match FAKE's bracket
		}
		for(int j=0;j<=J;++j) {
			if(f[j][0]) addl(g[i+1+j][0],C(n-i-1,j)*f[j][0]);
			if(f[j][2]) addl(g[i+1+j][2],C(n-i-1,j)*f[j][2]);
		}
		add(F[0][0],g[i+1][0]),add(F[0][2],g[i+1][2]);
		for(int j=0;j<=J;++j) G[j][0]=G[j][1]=G[j][2]=f[j][0]=f[j][2]=0;
	}
	ll tot=1;
	for(int i=1;i<=n;i+=2) tot=tot*i%MOD;
	printf("%lld\n",(tot+MOD-dp[0][0][0])%MOD);
	return 0;
}