#include<iostream>
#include<cstdio>
#define N 6000
using namespace std;
int read()
{
    char c=0;
    int sum=0;
    while (c<'0'||c>'9') c=getchar();
    while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
    return sum;
}
int n,mod,fac[N+1],invfac[N+1],C[N+1][N+1],dp[N+1][N+1],F[N+1][N+1],ans=1;
__int128 delta[N+1];
int MD(int x)
{
    return x>=mod?x-mod:x;
}
void Adder(int &x,int d)
{
    x+=d;
    if (x>=mod) x-=mod;
    return;
}
void Adder2(int &x,int d)
{
    x+=d;
    if (x<0) x+=mod;
    return;
}
int fast_pow(int a,int b)
{
    int res=1,mul=a;
    while (b)
    {
	if (b&1) res=1ll*res*mul%mod;
	mul=1ll*mul*mul%mod,b>>=1;
    }
    return res;
}
int main()
{
    int s;
    n=read(),mod=read(),fac[0]=1;
    for (int i=1;i<=N;++i) fac[i]=1ll*fac[i-1]*i%mod;
    invfac[N]=fast_pow(fac[N],mod-2);
    for (int i=N-1;i>=0;--i) invfac[i]=1ll*invfac[i+1]*(i+1)%mod;
    for (int i=0;i<=N;++i) C[i][0]=1;
    for (int i=1;i<=N;++i)
	for (int j=1;j<=i;++j)
	    C[i][j]=MD(C[i-1][j-1]+C[i-1][j]);
    for (int i=0;i<=N;++i)
    {
	F[i][0]=1;
	for (int j=1;j<=N;++j) F[i][j]=1ll*F[i][j-1]*(i+j-1)%mod;
    }
    for (int i=1;i<=n;++i) ans=1ll*ans*((i<<1)-1)%mod;
    for (int i=2;i<=(n<<1);i+=2)
    {
	s=(i-2)>>1,Adder(dp[i][s+1],fac[s+1]);
	for (int j=2;j<=i-2;j+=2)
	{
	    for (int k=1;k<=i;++k) delta[k]=0;
	    for (int k=1;k<=j;++k)
		if (dp[j][k])
		{
		    s=(i-2-j)>>1;
		    for (int t=1;t<=s;++t) delta[t+1]+=(__int128)(dp[j][k])*F[j-k+1][s-t]*(k+1+s-t)*F[((s-t)<<1)+j+3][t-1];
		    Adder(dp[i][1],1ll*dp[j][k]*F[j-k+1][s]%mod);
		}
	    for (int k=1;k<=i;++k) Adder(dp[i][k],delta[k]%mod);
	}
    }
    for (int i=1;i<=(n<<1);++i) Adder2(ans,-dp[n<<1][i]);
    printf("%d\n",ans);
    return 0;
}