#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using i128 = __int128;
using u128 = unsigned __int128;
template <typename T>
void chkmax(T &x, const T &y) {
  if (x < y) x = y;
}
template <typename T>
void chkmin(T &x, const T &y) {
  if (y < x) x = y;
}
namespace brt {
int p;
ull coef;
void init(int _p) {
  p = _p;
  coef = (1ull << 62) / p;
}
int reduce(ll x) {
  x -= (((i128)x * coef) >> 62) * p;
  return x >= p ? x - p : x;
}
}  // namespace brt
int mod;
void inc(int &x, int y) {
  x += y;
  if (x >= mod) x -= mod;
}
int sub(int x, int y) {
  x -= y;
  return x < 0 ? x + mod : x;
}
void upd(int &x, ll y) { x = brt::reduce(x + y); }
int qpow(int x, int y) {
  int ret = 1;
  for (; y; y >>= 1, x = (ll)x * x % mod)
    if (y & 1) ret = (ll)ret * x % mod;
  return ret;
}
constexpr int MAXN = 2e4 + 10;
int n, f[2][MAXN][3], ext[MAXN * 2][2], fac[MAXN * 2], ifac[MAXN * 2];
int A(int x, int y) { return brt::reduce((ll)fac[x] * ifac[x - y]); }
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  cin >> n >> mod;
  brt::init(mod);
  fac[0] = 1;
  for (int i = 1; i <= n * 2; ++i) fac[i] = (ll)fac[i - 1] * i % mod;
  ifac[n * 2] = qpow(fac[n * 2], mod - 2);
  for (int i = n * 2 - 1; i >= 0; --i) ifac[i] = (ll)ifac[i + 1] * (i + 1) % mod;
  int p = 0;
  f[0][0][2] = 1;
  for (int i = 2; i <= n * 2; ++i) {
    p ^= 1;
    memset(f[p], 0, sizeof(int) * (min(i, n * 2 - i) + 1) * 3);
    for (int j = 0, up = min(i - 1, n * 2 - i + 1); j <= up; ++j) {
      int cur = f[!p][j][0];
      if (cur) inc(f[p][j][2], cur);
      cur = f[!p][j][1];
      if (cur) {
        inc(f[p][j + 1][1], cur);
        inc(f[p][j][0], cur);
      }
      cur = f[!p][j][2];
      if (cur) {
        inc(f[p][j + 1][2], cur);
        upd(ext[i + j][0], (ll)cur * A(n * 2 - i, j));
        upd(ext[i + j - 1][1], (ll)brt::reduce((ll)cur * A(n * 2 - i, j - 1)) * j);
      }
    }
    inc(f[p][0][0], ext[i][0]);
    inc(f[p][0][1], ext[i][1]);
  }
  int all = 1;
  for (int i = n * 2 - 1; i >= 1; i -= 2) all = (ll)all * i % mod;
  cout << sub(all, f[p][0][0]) << "\n";
  return 0;
}
/*
g++ kingdom.cpp -o kingdom -std=c++14 -O2 -Wall -Wextra -Wshadow -g -fsanitize=address,undefined
*/