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

template<class T>
bool chmax(T& a, const T& b) {
    if (a < b) { a = b; return true; }
    return false;
}
template<class T>
bool chmin(T& a, const T& b) {
    if (b < a) { a = b; return true; }
    return false;
}

// std::vector Declaration
template<typename T>
vector<T> make_v(size_t a) { return vector<T>(a); }
template<typename T, typename... Ts>
auto make_v(size_t a, Ts... ts) {
    return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}

// std::vector Declaration and Initialization
template<typename T>
vector<T> make_vector(size_t a, T x) { return vector<T>(a, x); }
template<typename T, typename U, typename... Ts>
auto make_vector(size_t a, U b, Ts... ts) {
    return vector<decltype(make_vector<T>(b,ts...))>(a, make_vector<T>(b, ts...));
}

// std::vector Input
template<typename T>
istream& operator>>(istream& is, vector<T>& v) {
    for (auto &e : v) is >> e;
    return is;
}

// std::vector Debug
template<typename T>
ostream& operator<<(ostream& os, const vector<T>& v) {
    os << "[";
    bool a = 1;
    for (auto e : v) {
        os << (a ? "" : " ");
        os << e;
        a = 0;
    }
    os << "]";
    return os;
}

// std::array Debug
template<typename T, size_t n>
ostream& operator<<(ostream& os, const array<T, n>& v) {
    os << "[";
    bool a = 1;
    for (auto e : v) {
        os << (a ? "" : " ");
        os << e;
        a = 0;
    }
    os << "]";
    return os;
}

// std::deque Debug
template<typename T>
ostream& operator<<(ostream& os, const deque<T>& d) {
    os << "[";
    bool a = 1;
    for (auto e : d) {
        os << (a ? "" : " ");
        os << e;
        a = 0;
    }
    os << "]";
    return os;
}

// std::pair Debug
template<typename T, typename U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
    os << "(" << p.first << " " << p.second << ")";
    return os;
}

// std::set Debug
template<typename T>
ostream& operator<<(ostream& os, const set<T>& st) {
    os << "{";
    bool a = 1;
    for (auto e : st) {
        os << (a ? "" : " ");
        os << e;
        a = 0;
    }
    os << "}";
    return os;
}

// std::multiset Debug
template<typename T>
ostream& operator<<(ostream& os, const multiset<T>& st) {
    os << "{";
    bool a = 1;
    for (auto e : st) {
        os << (a ? "" : " ");
        os << e;
        a = 0;
    }
    os << "}";
    return os;
}

// std::map Debug
template<typename T, typename U>
ostream& operator<<(ostream& os, const map<T, U>& mp) {
    os << "{";
    bool a = 1;
    for (auto e : mp) {
        os << (a ? "" : " ");
        os << e.first << ":" << e.second;
        a = 0;
    }
    os << "}";
    return os;
}

// std::tuple Debug
template<int N, class Tuple>
void out(ostream& os, const Tuple& t){}
template<int N, class Tuple, class H, class ...Ts>
void out(ostream& os, const Tuple& t) {
    if (N) os << " ";
    os << get<N>(t);
    out<N+1,Tuple,Ts...>(os, t);
}
template<class ...Ts>
ostream& operator<<(ostream& os, const tuple<Ts...>& t) {
    os << "(";
    out<0,tuple<Ts...>,Ts...>(os, t);
    os << ")";
    return os;
}

// Debug
#define DUMP(x) cerr<<#x<<" = "<<(x)<<endl

// Weighted edge
template<typename T>
struct edge {
    int src, to;
    T cost;

    edge() {}
    edge(int to, T cost) : src(-1), to(to), cost(cost) {}
    edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}

    friend ostream& operator<<(ostream& os, const edge& e) {
        return os << "(" << e.src << "->" << e.to << ":" << e.cost << ")";
    }
};

using LL = int64_t;

#define fs first
#define sc second

const int64_t MOD = 1e9+7;


const LL pow(LL x, LL n, LL m) {
    LL ret = 1, tmp = x;
    while (n) {
        if (n & 1) (ret *= tmp) %= m;
        (tmp *= tmp) %= m;
        n >>= 1;
    }
    return ret;
}


int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);

    LL N, M; cin >> N >> M;

    vector<LL> fact(3*N+1), rfact(3*N+1), inv(3*N+1);
    fact[0] = 1;
    for (int i = 1; i <= 3*N; ++i) {
        fact[i] = (fact[i-1] * i) % M;
    }

    rfact[3*N] = pow(fact[3*N], M-2, M);
    for (int i = 3*N-1; i >= 0; --i) {
        rfact[i] = (rfact[i+1] * (i+1)) % M;
    }

    for (int i = 1; i <= 3*N; ++i) {
        inv[i] = (fact[i-1] * rfact[i]) % M;
    }

    auto dp = make_v<LL>(3*N+1, 6*N+1);

    dp[0][3*N] = fact[3*N];

    for (int s = 0; s < 3*N; ++s) {
        for (int d = -3*N; d <= 3*N; ++d) {

            if (s+1 <= 3*N && d+1 <= 3*N) {
                (dp[s+1][d+1 + 3*N] += dp[s][d + 3*N] * inv[s+1]) %= M;
            }
            if (s+2 <= 3*N && d-1 >= -3*N) {
                (dp[s+2][d-1 + 3*N] += dp[s][d + 3*N] * inv[s+2]) %= M;
            }
            if (s+3 <= 3*N) {
                (dp[s+3][d + 3*N] += dp[s][d + 3*N] * inv[s+3]) %= M;
            }
        }
    }

    LL ans = 0;
    for (int d = 0; d <= 3*N; ++d) {
        (ans += dp[3*N][d + 3*N]) %= M;
    }
    cout << ans << endl;


    return 0;
}


Measured memory_bytes: 565376