#include<cstdio>
#include<algorithm>
#include<cctype>
using namespace std;
#define G getchar()
int read()
{
	int x=0; char ch=G;
	for (;!isdigit(ch);ch=G);
	for (;isdigit(ch);ch=G) x=(x<<3)+(x<<1)+(ch^48);
	return x;
}
#undef G
typedef long long ll;
int Mod;
int fac[6010],inv[6010];

int n;
int dp[6010][9010],B=3000;
inline void add(int &x,ll y){x=(x+y)%Mod;}
int main()
{
	n=read()*3,Mod=read();
	fac[0]=1; for (int i=1;i<=n;i++) fac[i]=1LL*fac[i-1]*i%Mod;
	inv[1]=1; for (int i=2;i<=n;i++) inv[i]=1LL*(-Mod/i)*inv[Mod%i]%Mod;
	
	dp[0][B]=fac[n];
	for (int i=0;i<n;i++){
		for (int j=i+B;j>=0;j--){
			if (!dp[i][j]) continue;
			add(dp[i+1][j+1],1LL*dp[i][j]*inv[i+1]);
			if (i+2<=n&&j-1>=0) add(dp[i+2][j-1],1LL*dp[i][j]*inv[i+2]);
			if (i+3<=n) add(dp[i+3][j],1LL*dp[i][j]*inv[i+3]);
		}
	}
	int ans=0;
	for (int i=B;i<=n+B;i++) ans=(ans+dp[n][i])%Mod;
	printf("%d\n",(ans+Mod)%Mod);
	return 0;
}