#include <bits/stdc++.h>

int mod;

int add(int a, int b) {
    return a + b - (a + b >= mod) * mod;
}
int mul(int a, int b) {
    return a * 1ULL * b % mod;
}
int power(int b, int e) {
    int r = 1;
    for (; e > 0; e >>= 1) {
        if (e & 1) {
            r = mul(r, b);
        }
        b = mul(b, b);
    }
    return r;
}

int32_t main() {
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(nullptr);

    int n;
    std::cin >> n >> mod;

    std::vector<int> vec(2 * n);
    int cnt = 0;
    auto fuck = [&](auto fuck, uint64_t mask) -> void {
        if (mask == 0) {
            int grd = 0;
            for (int i = 0; i < 2 * n; i++) {
                if (vec[i] != -1) {
                    i = vec[i];
                    grd++;
                }
            }
            int opt = 0;
            for (int i = 0; i < 2 * n; i++) {
                int ind = i;
                for (int j = i; j < 2 * n; j++) {
                    if (vec[ind] == -1 || vec[j] != -1 && vec[j] < vec[ind]) {
                        ind = j;
                    }
                }
                if (vec[ind] == -1) {
                    break;
                }
                i = vec[ind];
                opt++;
            }
            cnt = add(cnt, opt == grd);
            return;
        }
        int i = std::countr_zero(mask);
        for (int j = i + 1; j < 2 * n; j++) {
            if (mask >> j & 1) {
                vec[i] = j;
                vec[j] = -1;
                fuck(fuck, mask ^ 1ULL << i ^ 1ULL << j);
            }
        }
    };

    fuck(fuck, (1ULL << 2 * n) - 1);

    int all = 1;
    for (int i = 1; i < 2 * n; i += 2) {
        all = mul(all, i);
    }
    int ans = add(all, mod - cnt);
    std::cout << ans << "\n";

    return 0;
}