// Problem: B. 数列
// Contest: undefined - NOIP2024训练赛 04
// URL: http://noi.ac/contest/1156/problem/2157
// Memory Limit: 1024 MB
// Time Limit: 1000 ms
// Challenger: Erica N
// ----
// 
#include<bits/stdc++.h>

using namespace std;
#define rd read()
#define ull unsigned long long
#define int long long 
#define pb push_back
#define itn int
#define ps second 
#define pf first


#define rd read()
int read(){
  int xx = 0, ff = 1;char ch = getchar();
  while (ch < '0' || ch > '9'){
    if (ch == '-')ff = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9')xx = xx * 10 + (ch - '0'), ch = getchar();
  return xx * ff;
}
#define zerol = 1
#ifdef zerol
#define cdbg(x...) do { cerr << #x << " -> "; err(x); } while (0)
void err() {cerr << endl;}
template<template<typename...> class T, typename t, typename... A>
void err(T<t> a, A... x) {
	for (auto v: a) cerr << v << ' ';err(x...);
}
template<typename T, typename... A>
void err(T a, A... x) {
	cerr << a << ' ';err(x...);
}
#else
#define dbg(...)
#endif
const int N=2e6+5;
const ull P=137;
int MOD;
const int INF=1e18+7;
/*

策略


*/	

int ksm(int a,int b){
	int res=1;
	while(b){
		if(b&1)res=res*a%MOD;
		b>>=1;
		a=a*a%MOD;
	}
	return res;
}

int fac[N],inv[N];

void init(){
	fac[0]=1;
	for(int i=1;i<N;i++){
		fac[i]=fac[i-1]*i%MOD;
	}
	
}


inline int C(int n,int m){
	if(m>n)return 0;
	return fac[n]*ksm(fac[n-m],MOD-2)%MOD*ksm(fac[m],MOD-2)%MOD;
}

signed main(){
	int n=rd;
	MOD=rd;
	init();
	
	cout<<C(2*n,n)*ksm(n+1,MOD-2)%MOD;
	// cdbg(C(2*n,n),inv[n+1])
}