#include<bits/stdc++.h>
using namespace std;

int N;
long long ans, p;
long long power[2000006], inv[2000006];

long long qpow(long long a, long long b){
	long long res = 1;
	while (b){
		if (b & 1) res = (res * a) % p;
		a = (a * a) % p;
		b >>= 1;
	}
	return res;
}

void __init(){
	power[0] = inv[0] = 1;
	for (int i = 1; i <= 2 * N + 2; i ++){
		power[i] = (power[i - 1] * i) % p;
	}
}

long long getC(int n, int m){
	long long res = power[n];
	inv[m] = qpow(power[m], p - 2);
	inv[n - m] = qpow(power[n - m], p - 2);
	res = (res * inv[m]) % p;
	res = (res * inv[n - m]) % p;
	return res;
}

int main(){
#ifndef ONLINE_JUDGE
	freopen("../data.in", "r", stdin);
	freopen("../data.out", "w", stdout);
#endif

	scanf("%d %lld", &N, &p);
	__init();
	ans = getC(2 * N, N);
	ans -= getC(2 * N, N - 1);
	ans = (ans + p) % p;
	printf("%lld\n", ans);

	return 0;
}