#include <iostream>
#include <algorithm>

typedef long long ll;
typedef double lf;

// #define DEBUG 1
struct IO
{
    #define MAXSIZE (1 << 20)
    #define isdigit(x) (x >= '0' && x <= '9')
    char buf[MAXSIZE], *p1, *p2;
    char pbuf[MAXSIZE], *pp;
    #if DEBUG
    #else
    IO() : p1(buf), p2(buf), pp(pbuf) {}
    ~IO() {fwrite(pbuf, 1, pp - pbuf, stdout);}
    #endif
    #define gc() (p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, MAXSIZE, stdin), p1 == p2) ? ' ' : *p1++)
    #define blank(x) (x == ' ' || x == '\n' || x == '\r' || x == '\t')

    template <typename T>
    void Read(T &x)
    {
        #if DEBUG
        std::cin >> x;
        #else
        bool sign = 0; char ch = gc(); x = 0;
        for (; !isdigit(ch); ch = gc())
            if (ch == '-') sign = 1;
        for (; isdigit(ch); ch = gc()) x = x * 10 + (ch ^ 48);
        if (sign) x = -x;
        #endif
    }
    void Read(char *s)
    {
        #if DEBUG
        std::cin >> s;
        #else
        char ch = gc();
        for (; blank(ch); ch = gc());
        for (; !blank(ch); ch = gc()) *s++ = ch;
        *s = 0;
        #endif
    }
    void Read(char &c) {for (c = gc(); blank(c); c = gc());}

    void Push(const char &c)
    {
        #if DEBUG
        putchar(c);
        #else
        if (pp - pbuf == MAXSIZE) fwrite(pbuf, 1, MAXSIZE, stdout), pp = pbuf;
        *pp++ = c;
        #endif
    }
    template <typename T>
    void Write(T x)
    {
        if (x < 0) x = -x, Push('-');
        static T sta[35];
        int top = 0;
        do sta[top++] = x % 10, x /= 10; while (x);
        while (top) Push(sta[--top] ^ 48);
    }
    template <typename T>
    void Write(T x, char lst) {Write(x), Push(lst);}
} IO;
#define Read(x) IO.Read(x)
#define Write(x, y) IO.Write(x, y)
#define Put(x) IO.Push(x)

using namespace std;

const int MAXN = 3e3 + 10, MAXM = 4e4 + 10;

int n, mod;

ll f[MAXN][MAXN], g[MAXN][MAXN];

ll fac[MAXM], inv[MAXM];
inline ll C(int n, int m) {return fac[n] * inv[n - m] % mod * inv[m] % mod;}

int main()
{
    #if DEBUG
    #else
    ios::sync_with_stdio(0), cin.tie(0);
    #endif
    Read(n), Read(mod);

    fac[0] = fac[1] = inv[0] = inv[1] = 1;
    for (int i = 2; i < MAXM; i++) fac[i] = fac[i - 1] * i % mod, inv[i] = (mod - mod / i) * inv[mod % i] % mod;
    for (int i = 2; i < MAXM; i++) inv[i] = inv[i - 1] * inv[i] % mod;
    
    f[n][0] = 1;
    for (int i = n; i >= 1; i--)
    {
        for (int j = 1; j <= i; j++) g[i][j] = (g[i][j] + g[i][j - 1]) % mod;
        for (int j = 0; j <= i; j++) f[i][j] = (f[i][j] + g[i][j] + mod) % mod;
        f[i - 1][0] = (f[i - 1][0] + f[i][0]) % mod;
        for (int j = 0; j <= i; j++)
        {
            for (int x = max(2, j + 1); x <= i; x++)
            {
                if (x <= 2 * i - 2) f[i - x][0] = (f[i - x][0] + f[i][j] * C(2 * i - x - 1, x - 1) % mod * fac[x - 1]) % mod;
                int r = 2 * i - 2 - x;
                if (r < 0) continue;
                // for (int y = 0; y <= r; y++)
                //     f[i - x][y] = (f[i - x][y] + f[i][j] * C(2 * i - x - 1, x - 2) % mod * fac[x - 1]) % mod;
                g[i - x][0] = (g[i - x][0] + f[i][j] * C(2 * i - x - 1, x - 2) % mod * fac[x - 1]) % mod;
                if (r < 2 * n) g[i - x][r + 1] = (g[i - x][r + 1] - f[i][j] * C(2 * i - x - 1, x - 2) % mod * fac[x - 1]) % mod;
            }
        }
    }
    f[0][0] = (f[0][0] + g[0][0] + mod) % mod;
    ll ans = 1;
    for (int i = 3; i <= 2 * n; i += 2) ans = ans * i % mod;
    cout << (ans - f[0][0] + mod) % mod << "\n";
    return 0;
}