#include <bits/stdc++.h>
#define pb emplace_back
#define fst first
#define scd second
#define mkp make_pair
#define mems(a, x) memset((a), (x), sizeof(a))

using namespace std;
typedef long long ll;
typedef double db;
typedef unsigned long long ull;
typedef long double ldb;
typedef pair<ll, ll> pii;

const int maxn = 1000100;

ll n, mod, fac[maxn], ifac[maxn];

inline ll qpow(ll b, ll p) {
	ll res = 1;
	while (p) {
		if (p & 1) {
			res = res * b % mod;
		}
		b = b * b % mod;
		p >>= 1;
	}
	return res;
}

inline ll C(ll n, ll m) {
	if (n < m || n < 0 || m < 0) {
		return 0;
	} else {
		return fac[n] * ifac[m] % mod * ifac[n - m] % mod;
	}
}

inline ll F(ll n) {
	return n ? (C(n * 2, n) - C(n * 2, n - 1) + mod) % mod : 1;
}

void solve() {
	if (n == 1) {
		puts("0");
		return;
	}
	fac[0] = 1;
	for (int i = 1; i <= n * 2; ++i) {
		fac[i] = fac[i - 1] * i % mod;
	}
	ifac[n * 2] = qpow(fac[n * 2], mod - 2);
	for (int i = n * 2 - 1; ~i; --i) {
		ifac[i] = ifac[i + 1] * (i + 1) % mod;
	}
	--n;
	ll ans = 0, p = 1;
	for (int i = 0; i <= n; ++i, p = (p + p < mod ? p + p : p + p - mod)) {
		ans = (ans + p * (((n - i) & 1) ? mod - 1 : 1) % mod * C(n + i, n - i) % mod * F(i)) % mod;
	}
	ans = (fac[n + 1] - ans * 2 % mod + mod) % mod;
	printf("%lld\n", ans);
}

int main() {
	while (scanf("%lld%lld", &n, &mod) == 2) {
		solve();
	}
	return 0;
}