#include <bits/stdc++.h>
using namespace std;

typedef pair<int, int> pii;
typedef long long ll;
template <class T>
using V = vector<T>;
template <class T>
using VV = V<V<T>>;

#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, m, n) for (int i = m; i < (n); i++)
#define ALL(c) (c).begin(), (c).end()

#ifdef LOCAL
#define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl
#else
#define dump(x) true
#endif

constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); }

template <class T, class U>
void chmin(T& t, const U& u) {
    if (t > u) t = u;
}
template <class T, class U>
void chmax(T& t, const U& u) {
    if (t < u) t = u;
}

template <class T, class U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
    os << "(" << p.first << "," << p.second << ")";
    return os;
}

template <class T>
ostream& operator<<(ostream& os, const vector<T>& v) {
    os << "{";
    rep(i, v.size()) {
        if (i) os << ",";
        os << v[i];
    }
    os << "}";
    return os;
}

template <typename T>
struct ModInt {
    using uint = unsigned int;
    using ull = unsigned long long;
    using M = ModInt;
    uint MOD = T::mod;

    uint v;

    ModInt(ll _v = 0) { set_norm(_v % MOD + MOD); }
    M& set_norm(uint _v) {  //[0, MOD * 2)->[0, MOD)
        v = (_v < MOD) ? _v : _v - MOD;
        return *this;
    }

    explicit operator bool() const { return v != 0; }
    M operator+(const M& a) const { return M().set_norm(v + a.v); }
    M operator-(const M& a) const { return M().set_norm(v + MOD - a.v); }
    M operator*(const M& a) const { return M().set_norm(ull(v) * a.v % MOD); }
    M operator/(const M& a) const { return *this * a.inv(); }
    M& operator+=(const M& a) { return *this = *this + a; }
    M& operator-=(const M& a) { return *this = *this - a; }
    M& operator*=(const M& a) { return *this = *this * a; }
    M& operator/=(const M& a) { return *this = *this / a; }
    M operator-() const { return M() - *this; }
    M& operator++(int) { return *this = *this + 1; }
    M& operator--(int) { return *this = *this - 1; }

    M pow(ll n) const {
        if (n < 0) return inv().pow(-n);
        M x = *this, res = 1;
        while (n) {
            if (n & 1) res *= x;
            x *= x;
            n >>= 1;
        }
        return res;
    }

    M inv() const { return pow(MOD - 2); }

    /*

        M inv() const {
                ll a = v, b = MOD, p = 1, q = 0, t;
                while (b != 0) {
                        t = a / b;
                        swap(a -= t * b, b);
                        swap(p -= t * q, q);
                }
                return M(p);
        }*/

    bool operator==(const M& a) const { return v == a.v; }
    bool operator!=(const M& a) const { return v != a.v; }
    friend ostream& operator<<(ostream& os, const M& a) { return os << a.v; }
    uint get_mod() { return MOD; }
};

struct ModInfo {
    static int mod;
};

int ModInfo::mod;
int& md = ModInfo::mod;

int main() {
    int N;
    cin >> N >> md;
    using Mint = ModInt<ModInfo>;
    VV<Mint> dp(6010, V<Mint>(6010));
    int n = N * 3;

    dp[0][0] = 1;
    for (int i = 1; i <= n; ++i) {
        if (i >= 3) {
            for (int j = 0; j <= n; ++j) {
                dp[i][j + 1] += dp[i - 3][j] * (i - 1) * (i - 2);
            }
        }
        if (i >= 2) {
            for (int j = 0; j <= n; ++j) {
                dp[i][j + 1] += dp[i - 2][j] * (i - 1);
            }
        }
        for (int j = 0; j <= n; ++j) {
            dp[i][j] += dp[i - 1][j];
        }
    }
    Mint ans = 0;
    for (int i = 0; i <= N; ++i) {
        ans += dp[n][i];
    }
    cout << ans << endl;
    return 0;
}

Measured memory_bytes: 284800