这个质因数分解劲啊
/* Telekinetic Forest Guard */
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
typedef long long LL;
const int maxn = 2000005;
int n, m, p, prime[maxn], mn[maxn], cnt, num[maxn];
bool isnotprime[maxn];
inline void getprime() {
isnotprime[1] = 1;
for(int i = 1; i <= m; i++) {
if(!isnotprime[i]) prime[++cnt] = i, mn[i] = cnt;
for(int j = 1; j <= cnt && i * prime[j] <= m; j++) {
isnotprime[i * prime[j]] = 1;
mn[i * prime[j]] = j;
if(i % prime[j] == 0) break;
}
}
}
inline int qpow(int x, int n) {
int res = 1;
for(; n; n >>= 1, x = (LL)x * x % p) if(n & 1) res = (LL)res * x % p;
return res;
}
inline void add(int x, int f) {
for(; x != 1; x /= prime[mn[x]]) num[mn[x]] += f;
}
int main() {
scanf("%d%d", &n, &p); m = n << 1;
getprime();
for(int i = n + 1; i <= m; i++) add(i, 1);
for(int i = 1; i <= n; i++) add(i, -1);
add(n + 1, -1);
int ans = 1;
for(int i = 1; i <= cnt; i++) if(num[i]) ans = (LL)ans * qpow(prime[i], num[i]) % p;
printf("%d\n", ans);
return 0;
}