#include<bits/stdc++.h>
#define ll long long
using namespace std;
int n,MOD;
ll ksm(ll a,ll b=MOD-2,ll p=MOD) {
	ll ret=1;
	for(;b;a=a*a%p,b>>=1) if(b&1) ret=ret*a%p;
	return ret;
}
const int MAXN=1e7+5;
ll fac[MAXN],ifac[MAXN];
ll C(int x,int y) { return fac[x]*ifac[y]%MOD*ifac[x-y]%MOD; }
void solve() {
	if(n<=2) return puts("0"),void();
	for(int i=fac[0]=1;i<=2*n;++i) fac[i]=fac[i-1]*i%MOD;
	ifac[2*n]=ksm(fac[2*n]);
	for(int i=2*n;i;--i) ifac[i-1]=ifac[i]*i%MOD;
	ll ans=0,pw=2;
	for(int i=0;i<=n;++i) {
		ans=(ans+((n-i)%2?-1:1)*pw*C(n+i,n-i)%MOD*(i?C(2*i,i)-C(2*i,i-1):1))%MOD;
		pw=pw*2%MOD;
	}
	printf("%lld\n",(fac[n+1]+MOD-ans)%MOD);
}
signed main() {
	while(~scanf("%d%d",&n,&MOD)) solve();
	return 0;
}