#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <chrono>
#include <climits>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;

template <class T1, class T2>
ostream& operator << (ostream& out, const pair <T1, T2> p)
{
    out << '(' << p.first << ',' << p.second << ')';
    return out;
}

template <class T1, class T2>
istream& operator >> (istream& in, pair<T1, T2> &p)
{
    in >> p.first >> p.second;
    return in;
}

template <class T>
istream& operator >> (istream& in, vector<T> &v)
{
    for (T &x : v)
        in >> x;
    return in;
}

template <class T>
ostream& operator << (ostream& out, const vector<vector<T>> &v)
{
    for (const vector<T> &x : v)
        out << x << '\n';
    return out;
}

template <class T>
ostream& operator << (ostream& out, const vector<T> &v)
{
    for (const T &x : v)
        out << x << ' ';
    return out;
}

long long gcd (long long a, long long b)
{
    if (b > a)
        swap(a, b);
    return (b ? gcd(b, a % b) : a);
}

using ll   = long long;
using pii  = pair<int, int>;
using pll  = pair<long long, long long>;
using tiii = pair<pair<int, int>, int>;
using vi   = vector<int>;
using vl   = vector<long long>;
using vvi  = vector<vector<int>>;
using vvl  = vector<vector<long long>>;

#define F          first
#define S          second
#define First      first.first
#define Second     first.second
#define Third      second
#define mp         make_pair
#define rep(i,a,b) for (int i = (a); i < (b); i++)
#define per(i,b,a) for (int i = (b); i > (a); i--)
#define all(x)     x.begin(), x.end()
#define ret(x)     return cout << x, 0;
#define throwex    throw runtime_error ("Found the error.");

const int h = 1000000007;

namespace modexp
{
    const int default_mod = 1000000007;

    constexpr long long p (long long x, long long y, int mod = default_mod)
    {
        long long ans = 1;
        while(y)
        {
            if(y & 1)
                (ans *= x) %= mod;
            (x *= x) %= mod;
            y /= 2;
        }
        return ans;
    }

    constexpr long long inv (const long long x, int mod = default_mod)
    {
        return p (x, mod - 2, mod);
    }
}
using modexp::p;
using modexp::inv;

signed main()
{
    ios::sync_with_stdio(false);
    #ifdef ONLINE_JUDGE
    cin.tie(nullptr);
    cout.tie(nullptr);
    cerr.setstate(ios::failbit);
    #endif

    int n, m;
    cin >> n >> m;
    vvl dp(3 * n + 1, vl(6 * n + 1));
    ll first = - 3 * n;
    dp[0][0 - first] = 1;
    rep(i,1,3*n+1)
    {
        ll in = inv(i, m);
        if(i > 2)
            rep(j,-3*n,3*n+1-3)
                (dp[i][j - first] += dp[i-3][j - first] * in % m) %= m;
        if(i > 0)
            rep(j,-3*n,3*n+1-1)
                (dp[i][j + 1 - first] += dp[i-1][j - first] * in % m) %= m;
        if(i > 1)
            rep(j,-3*n+1,3*n+1)
                (dp[i][j - 1 - first] += dp[i-2][j - first] * in % m) %= m;
    }
    // cerr << dp << '\n';
    ll ans = 0;
    rep(i,0 - first,6*n+1)
        (ans += dp.back()[i]) %= m;
    ll nf = 1;
    rep(i,1,3*n+1)
        (nf *= i) %= m;
    // cerr << ans << '\n';
    (ans *= nf) %= m;
    cout << ans;
}


Measured memory_bytes: 566024