#include <bits/stdc++.h>
#define lowbit(x) (x & -x)
#define eb emplace_back
#define pb push_back
#define mp make_pair
using namespace std;

typedef long long ll;
typedef vector<int> poly;
const int N = 2e4+5;

int n, Mod, ans = 1;
int f[N][2];
ll Bfac[N * 2], Bifac[N * 2], *fac = Bfac + 2, *ifac = Bifac + 2;

inline ll qpow(int a, int b) {
	ll base = a, ans = 1;
	while (b) {
		if (b & 1) ans = ans * base % Mod;
		base = base * base % Mod;
		b >>= 1;
	}
	return ans;
}

inline void Add(int &a, int b) { a += b; if (a >= Mod) a -= Mod; }
inline void Add(ll &a, int b) { a += b; if (a >= Mod) a -= Mod; }

inline poly add(const poly &x, const poly &y) {
	int n = x.size(), m = y.size();
	poly ret = x;
	if (m > n) ret.resize(m);
	for (int i = 0; i < m; i++) Add(ret[i], y[i]);
	return ret;
}

inline poly sub(const poly &x, const poly &y) {
	int n = x.size(), m = y.size();
	poly ret = x;
	if (m > n) ret.resize(m);
	for (int i = 0; i < m; i++) Add(ret[i], Mod - y[i]);
	return ret;
}

inline poly mul(const poly &x, const poly &y) {
	int n = x.size(), m = y.size();
	if (!n || !m) return poly();

	poly ret(n + m - 1, 0);
	// if (1) {
	if ((ll) n * m <= 128) {
		for (int i = 0; i < n; i++)
			for (int j = 0; j < m; j++)
				ret[i + j] = (ret[i + j] + (ll) x[i] * y[j]) % Mod;
		return ret;
	}

	int mid = min(max(n, m) / 2, min(n, m));
	poly B = poly(x.begin(), x.begin() + mid), A = poly(x.begin() + mid, x.end());
	poly D = poly(y.begin(), y.begin() + mid), C = poly(y.begin() + mid, y.end());
	poly r0 = mul(B, D), r1 = mul(A, C), r2 = sub(sub(mul(add(A, B), add(C, D)), r0), r1);
	for (int i = r0.size(); i--; ) ret[i] = r0[i];
	for (int i = r1.size(); i--; ) Add(ret[i + 2 * mid], r1[i]);
	for (int i = r2.size(); i--; ) Add(ret[i + mid], r2[i]);
	return ret;
}

inline ll c0(int p, int q, ll j) { return (p * q * j * j + (p + q - p * q) * j) % Mod; }
inline ll c1(int p, int q, ll i) { return (p * q * i * i + (p * q - p - q) * i + (1 - p) * (1 - q) + Mod) % Mod; }

void solve(int l, int r) {
	if (l == r) return;
	int mid = (l + r) >> 1;
	solve(l, mid);
	// printf("|%d %d|\n", l, r);
	for (int p = 0; p < 2; p++)
		for (int q = 0; q < 2; q++) {
			poly A(mid - l + 1, 0), B(r - l, 0), C;

			for (int i = 0; i < r - l; i++) B[i] = fac[mid - 2 + l - q + i - p];
			if (p * q || (p + q - p * q)) {
				for (int i = l; i <= mid; i++) A[mid - i] = f[i][p] * ifac[2 * i - 2 - p] % Mod;
				C = mul(A, B);
				for (int i = mid - l; i <= r - l - 1; i++) {
					int j = i + 1 + l - q;
					Add(f[j + q][q], c0(p, q, j) * C[i] % Mod);
				}
			}

			if (p * q || (p * q - p - q) || (1 - p) * (1 - q)) {
				for (int i = l; i <= mid; i++) A[mid - i] = f[i][p] * ifac[2 * i - 2 - p] % Mod * c1(p, q, i) % Mod;
				C = mul(A, B);
				for (int i = mid - l; i <= r - l - 1; i++) Add(f[i + 1 + l][q], C[i]);
			}

			if (p * q) {
				for (int i = l; i <= mid; i++) A[mid - i] = f[i][p] * ifac[2 * i - 2 - p] % Mod * i % Mod;
				C = mul(A, B);
				for (int i = mid - l; i <= r - l - 1; i++) {
					int j = i + 1 + l - q;
					Add(f[j + q][q], Mod - C[i] * 2ll * j % Mod);
				}
			}
		}
	solve(mid + 1, r);
}

int main() {
	scanf("%d%d", &n, &Mod);

	fac[0] = 1;
	for (int i = 1; i <= 2 * n; i++) fac[i] = fac[i - 1] * i % Mod;
	ifac[2 * n] = qpow(fac[2 * n], Mod - 2);
	for (int i = 2 * n; i; i--) ifac[i - 1] = ifac[i] * i % Mod;

	f[1][0] = f[2][1] = 1;
	solve(1, n);

	for (int i = 3; i <= 2 * n; i += 2) ans = (ll) ans * i % Mod;
	for (int i = 1; i <= n; i++)
		for (int p = 0; p < 2; p++) {
			// printf("|%d %d %d|\n", i, p, f[i][p]);
			ll t = f[i][p];
			if (p) t = t * (n - i + 1) % Mod;
			Add(ans, Mod - t * fac[n + i - 3 + !p] % Mod * ifac[2 * i - 3 + !p] % Mod);
		}

	printf("%d", ans);
	return 0;
}