#include<cstdio>
#include<vector>
#include<algorithm>
using namespace std;
#define poly vector<int>
const int o=40010;
int n,p,fac[o],inv[o],f[o][2],a[o][2],b[o][2],c[o][2],ans=1;
inline int fix(int x){return x+(x>>31&p);}
poly add(poly a,poly b){
	if(b.size()>a.size()) a.resize(b.size());
	for(int i=b.size();i--;) a[i]=fix(a[i]+b[i]-p);
	return a;
}
poly sub(poly a,poly b){
	if(b.size()>a.size()) a.resize(b.size());
	for(int i=b.size();i--;) a[i]=fix(a[i]-b[i]);
	return a;
}
poly Karatsuba(poly a,poly b){
	if(a.empty()||b.empty()) return poly();
	int sa=a.size(),sb=b.size();
	if(min(sa,sb)<20){
		poly res(sa+sb-1);
		for(int i=0;i<sa;++i) for(int j=0;j<sb;++j) res[i+j]=(res[i+j]+a[i]*1ll*b[j])%p;
		return res;
	}
	int md=min(max(sa,sb)/2,min(sa,sb));
	poly al=poly(a.begin(),a.begin()+md),ar=poly(a.begin()+md,a.end());
	poly bl=poly(b.begin(),b.begin()+md),br=poly(b.begin()+md,b.end());
	poly t1=Karatsuba(al,bl),t2=Karatsuba(ar,br),t3=Karatsuba(add(al,ar),add(bl,br));
	t3=sub(t3,add(t1,t2));
	poly res(sa+sb-1);
	for(int i=t1.size();i--;) res[i]=fix(res[i]+t1[i]-p);
	for(int i=t2.size();i--;) res[i+md+md]=fix(res[i+md+md]+t2[i]-p);
	for(int i=t3.size();i--;) res[i+md]=fix(res[i+md]+t3[i]-p);
	return res;
}

inline void slv(int l,int r){
	if(l==r){
		for(int i=0;i<2;++i) f[l][i]=(f[l][i]+(a[l][i]*1ll*l+b[l][i])%p*l+c[l][i])%p;
		return;
	}
	int md=l+r>>1;
	slv(l,md);
	poly A(md-l+1),B(r-l),C;
	for(int i=l+md+1;i<=md+r;++i) B[i-(l+md+1)]=((i>=5)?fac[i-5]:0);
	reverse(B.begin(),B.end());
	for(int i=l;i<=md;++i) A[i-l]=f[i][0]*1ll*((i>1)?inv[i*2-3]:0)%p;
	C=Karatsuba(A,B);
	for(int i=md+1;i<=r;++i) a[i][0]=fix(a[i][0]+C[md+r-l-i]-p);
	for(int i=l;i<=md;++i) A[i-l]=A[i-l]*(p-1ll-2*i)%p;
	C=Karatsuba(A,B);
	for(int i=md+1;i<=r;++i) b[i][0]=fix(b[i][0]+C[md+r-l-i]-p);
	for(int i=l;i<=md;++i) A[i-l]=f[i][0]*1ll*((i>1)?inv[i*2-3]:0)%p*i%p*(i+1)%p;
	C=Karatsuba(A,B);
	for(int i=md+1;i<=r;++i) c[i][0]=fix(c[i][0]+C[md+r-l-i]-p);
	for(int i=l+md+1;i<=md+r;++i) B[i-(l+md+1)]=((i>=5)?fac[i-4]:0);
	reverse(B.begin(),B.end());
	for(int i=l;i<=md;++i) A[i-l]=f[i][0]*1ll*((i>1)?inv[i*2-3]:0)%p;
	C=Karatsuba(A,B);
	for(int i=md+1;i<=r;++i) b[i][1]=fix(b[i][1]+C[md+r-l-i]-p);
	for(int i=l;i<=md;++i) A[i-l]=A[i-l]*1ll*(p-i)%p;
	C=Karatsuba(A,B);
	for(int i=md+1;i<=r;++i) c[i][1]=fix(c[i][1]+C[md+r-l-i]-p);
	for(int i=l+md+1;i<=md+r;++i) B[i-(l+md+1)]=((i>=4)?fac[i-4]:0);
	reverse(B.begin(),B.end());
	for(int i=l;i<=md;++i) A[i-l]=f[i][1]*1ll*inv[i*2-2]%p;
	C=Karatsuba(A,B);
	for(int i=md+1;i<=r;++i) b[i][0]=fix(b[i][0]+C[md+r-l-i]-p);
	for(int i=l;i<=md;++i) A[i-l]=A[i-l]*1ll*(p-1ll-i)%p;
	C=Karatsuba(A,B);
	for(int i=md+1;i<=r;++i) c[i][0]=fix(c[i][0]+C[md+r-l-i]-p);
	for(int i=l+md+1;i<=md+r;++i) B[i-(l+md+1)]=((i>=3)?fac[i-3]:0);
	reverse(B.begin(),B.end());
	for(int i=l;i<=md;++i) A[i-l]=f[i][1]*1ll*inv[i*2-2]%p;
	C=Karatsuba(A,B);
	for(int i=md+1;i<=r;++i) c[i][1]=fix(c[i][1]+C[md+r-l-i]-p);
	slv(md+1,r);
}
int main(){
	scanf("%d%d",&n,&p);inv[1]=1;
	for(int i=2;i<=n*2;++i) inv[i]=p-p/i*1ll*inv[p%i]%p;
	for(int i=fac[0]=inv[0]=1;i<=n*2;++i) fac[i]=fac[i-1]*1ll*i%p,inv[i]=inv[i-1]*1ll*inv[i]%p;
	f[1][1]=f[2][0]=1;
	slv(1,n);
	for(int i=1;i<=n;++i) ans=ans*(2*i-1ll)%p;
	for(int i=2;i<=n;++i) ans=(ans+(p-f[i][0])*(n-i+1ll)%p*fac[n+i-3]%p*inv[i*2-3])%p;
	for(int i=1;i<=n;++i) ans=(ans+(p-f[i][1])*1ll*fac[n+i-2]%p*inv[i*2-2])%p;
	printf("%d",ans);
	return 0;
}