#include <cstdio>
using namespace std;
int n, p;
long long inv[2000010], invfac[2000010], fac[2000010];
int main() {
    scanf("%d%d", &n, &p);
    inv[1] = 1;
    for (int i = 2; i <= 2 * n; i++) {
        inv[i] = (p - p / i) * inv[p % i] % p;
    }
    invfac[0] = 1;
    fac[0] = 1;
    for (int i = 1; i <= 2 * n; i++) {
        fac[i] = fac[i - 1] * i % p;
        invfac[i] = invfac[i - 1] * inv[i] % p;
    }
    long long ans = fac[2 * n] * invfac[n] % p * invfac[n] % p * inv[n + 1] % p;
    printf("%lld\n", ans);
    return 0;
}