#include <bits/stdc++.h>
using namespace std;
using ll=long long;

int main(){
	ll n,m;
	cin>>n>>m;
	vector<vector<ll>> dp(2*n,vector<ll>(3));
	dp[1][2]=1%m;
	dp[2][1]=1%m;
	dp[2][2]=1%m;
	dp[3][0]=1%m;
	dp[3][1]=2%m;
	dp[3][2]=3%m;
	ll ans=1;
	for(ll i=4;i<2*n;i++){
		dp[i][0]=(dp[i-1][1]+dp[i-1][0])%m;
		dp[i][1]=(dp[i-1][0]*(i-2)%m+dp[i-1][1]+dp[i-1][2])%m;
		dp[i][2]=(dp[i-1][0]*((i-2)*(i-1)%m)+dp[i-1][1]*(i-1)%m+dp[i-1][2])%m;
		if(i&1)ans=ans*dp[i][0]%m;
	}
	for(ll i=1;i<2*n;i++)ans=ans*i%m;
	cout<<ans<<endl;

}