#include <bits/stdc++.h>

using namespace std;

#define int long long
// #define x first
// #define y second
#define File(a) freopen(a".in", "r", stdin), freopen(a".out", "w", stdout)

inline void debug() { cerr << '\n'; }
template<typename Type, typename... Other>
inline void debug(const Type& x, const Other&... y) { cerr << x << ' '; debug(y...); }
#define DEBUG(a...) cerr << "[" << #a << "] = ", debug(a);

typedef long long LL;
typedef pair<int, int> PII;

const int N = 200010;
const int INF = 0x3f3f3f3f;

template<typename Type>
inline void read(Type &res)
{
    res = 0;
    int ch = getchar(), flag = 0;
    while (!isdigit(ch)) flag |= ch == '-', ch = getchar();
    while (isdigit(ch)) res = (res << 3) + (res << 1) + (ch ^ 48), ch = getchar();
    res = flag ? -res : res;
}
template<typename Type, typename... Other>
inline void read(Type &res, Other&... y) { read(res), read(y...); }

int n, mod, base1, base2;
// ans = C(2n, 2) / (n + 1)

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

signed main()
{
    read(n, mod);
    for (int i = base1 = 1; i <= n; i ++) base1 = base1 * i % mod;
    for (int i = base2 = 1; i <= n << 1; i ++) base2 = base2 * i % mod;
    cout << base2 * ksm(base1 * base1 % mod, mod - 2, mod) % mod * ksm(n + 1, mod - 2, mod) % mod << '\n';
    return 0;
}