#include <bits/stdc++.h>
using namespace std;
  
#define ll long long
#define all(aaa) aaa.begin(), aaa.end()

const int N = 6005, D = 9005, Z = 3001;
ll dp[N][D];

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int n, m;
    cin >> n >> m;

    n *= 3;

    dp[0][Z] = 1;

    for (int i = 0; i < n; i++) {
        for (int j = 0; j < D; j++) {
            if (dp[i][j]) {
                if (j + 1 < D) {
                    dp[i + 1][j + 1] = (dp[i + 1][j + 1] + dp[i][j]) % m;
                }
                if (j > 0 && i + 2 <= n) {
                    dp[i + 2][j - 1] = (dp[i + 2][j - 1] + dp[i][j] * (i + 1)) % m;
                }
                if (i + 3 <= n) {
                    dp[i + 3][j] = (dp[i + 3][j] + dp[i][j] * (i + 2) % m * (i + 1)) % m;
                }
            }
        }
    }

    // cout << dp[2][Z - 1] << "\n";



    ll ans = 0;

    for (int j = Z; j < D; j++) {
        ans = (ans + dp[n][j]) % m;
    }

    cout << ans;

    return 0;   
}   