#include <bits/stdc++.h>
#define FOR(i, a, n) for(ll i = (ll)a; i < (ll)n; i++)
#define FORR(i, n) for(ll i = (ll)n - 1LL; i >= 0LL; i--)
#define rep(i, n) FOR(i, 0, n)
#define ALL(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
template <typename T> using V = vector<T>;

constexpr int Mod = 998244353;
constexpr int mod = 1e9 + 7;
constexpr ll inf = 1LL << 60;

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

/*-------------------------------------------*/

ll dp[6009][12009];

int main() {
    cin.tie(0);
    ios::sync_with_stdio(0);

    ll n, m;
    cin >> n >> m;
    dp[0][n * 3] = 1;
    rep(i, 3 * n + 1) rep(j, 6 * n + 1) if(dp[i][j]) {
        (dp[i + 1][j - 1] += dp[i][j]) %= m;
        (dp[i + 2][j + 1] += dp[i][j] * (i + 1)) %= m;
        (dp[i + 3][j] += dp[i][j] * (i + 1) % m * (i + 2)) %= m;
    }
    ll ans = 0;
    rep(j, n * 3 + 1) ans += dp[3 * n][j];
    cout << ans % m << endl;

    return 0;
}