#include <bits/stdc++.h>
#define C__ const
#define int long long
using namespace std;
C__ int N_ = 1e6 + 10;
int n, p;
namespace Task1 {
	bool vis[N_];
	int dfs(int pos, int last) {
		if (pos > n * 2) return 1;
		int res = 0;
		if (pos & 1) {
			for (int i = 1; i <= n * 2; i++)
			if (!vis[i]) {
				vis[i] = true;
				res += dfs(pos + 1, last);
				vis[i] = false;
				break;
			}
		} else {
			for (int i = last + 1; i <= n + pos / 2; i++)
			if (!vis[i]) {
				vis[i] = true;
				res += dfs(pos + 1, i);
				vis[i] = false;
			}
		}
		return res;
	}
}
inline int fpow(int a, int b, int MOD) { int c = 1; for (; b; (a *= a) %= MOD, b >>= 1) if (b & 1) (c *= a) %= MOD; return c; }
inline int inv(int a, int MOD) { return fpow(a, MOD - 2, MOD); }
signed main() {
	cin >> n >> p;
	int facn = 1, fac2n = 1;
	for (int i = 1; i <= n; i++) (facn *= i) %= p;
	fac2n = facn;
	for (int i = n + 1; i <= n + n; i++) (fac2n *= i) %= p;
	cout << inv(n + 1, p) * fac2n % p * inv(facn * facn % p, p) % p << "\n";
	return 0;
}