#include<bits/stdc++.h>
#define ll long long
#define fr(i,j,k) for(register int i=j;i<=k;++i)
#define rf(i,j,k) for(register int i=j;i>=k;--i)
#define foredge(i,j) for(register int i=head[j];i;i=e[i].nxt)
#define pb push_back
#define Times printf("Time:%.3lf\n",clock()/CLOCKS_PER_SEC)
#define pii pair<int,int>
#define mk make_pair
using namespace std;
inline int read(){
	int x=0;
	bool f=0;
	char c=getchar();
	while(!isdigit(c)) f|=(c=='-'),c=getchar();
	while(isdigit(c)) x=(x<<3)+(x<<1)+(c^48),c=getchar();
	return f?-x:x;
}
inline void write(int x){
    if(x<0){putchar('-');x=-x;}
    if(x>9)write(x/10);
    putchar(x%10+'0');
}
inline void writeln(int x){write(x); puts("");}
inline void writepl(int x){write(x); putchar(' ');}
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
inline int randfind(int l,int r){return rnd()%(r-l+1)+l;}
//inline void init(){
//	int t=read();
//	while(t--) work();
//}
const int Maxn=4e2+10;
int mod;
inline void add(int &x,int y){x+=y;if(x>=mod) x-=mod;}
inline int Add(int x,int y){x+=y;if(x>=mod) x-=mod;return x;}
inline int ksm(int x,int y=mod-2){
    int sum=1;
    while(y){
        if(y&1) sum=1ll*sum*x%mod;
        y=y/2;x=1ll*x*x%mod;
    }return sum;
}
int fac[Maxn<<1],ifac[Maxn<<1];
inline int C(int x,int y){if(x<y || x<0 || y<0) return 0;return 1ll*fac[x]*ifac[y]%mod*ifac[x-y]%mod;}
inline void into(int N){
    fac[0]=ifac[0]=1;
    fr(i,1,N) fac[i]=1ll*fac[i-1]*i%mod;
    ifac[N]=ksm(fac[N]);
    rf(i,N-1,1) ifac[i]=1ll*ifac[i+1]*(i+1)%mod;
}
int n,k,m;
inline void init(){
    n=read();k=read();m=n*2;mod=read();into(800);
}
int tr1[Maxn][Maxn][Maxn],tr2[Maxn][Maxn][Maxn],f[Maxn][Maxn<<1][Maxn];
int F[Maxn<<1];
int dp1[Maxn],dp2[Maxn][Maxn];
inline void Trans1(){
    fr(i,0,n/2) fr(j,0,n/2) dp2[i][j]=0;
    fr(pre,0,n) if(dp1[pre]) fr(i,0,n/2) fr(j,0,n/2) add(dp2[i][j],1ll*dp1[pre]*tr1[pre][i][j]%mod);
}
inline void Trans2(){
    fr(i,0,n) dp1[i]=0;
    fr(i,0,n/2) fr(j,0,n/2) if(dp2[i][j]) fr(nxt,0,n) add(dp1[nxt],1ll*dp2[i][j]*tr2[i][j][nxt]%mod);
}
inline void work(){
    memset(f,0,sizeof(f));f[0][0][0]=1;
    F[0]=1;for(int i=2;i<=m;i+=2) F[i]=1ll*F[i-2]*(i-1)%mod;
    fr(i,0,n) fr(j,0,m) fr(k,0,n){
        if(i){
            if(j) add(f[i][j][k],1ll*f[i-1][j-1][k]*(j)%mod);
            if(k) add(f[i][j][k],1ll*f[i-1][j][k-1]*k%mod);
        }
        else if(j){
            if(j>1) add(f[i][j][k],1ll*f[i][j-2][k]*(j-1)%mod);
            if(k) add(f[i][j][k],1ll*f[i][j-1][k-1]*k%mod);
        }
    }
    fr(i,0,n) fr(j,0,i/2) fr(k,0,i/2){
        tr1[i][j][k]=1ll*f[i-j*2][m-i*2][i-k*2]*C(i,j*2)%mod*F[j*2]%mod*C(i,k*2)%mod*F[k*2]%mod;
        // cout<<i<<' '<<j<<' '<<k<<' '<<tr1[i][j][k]<<endl;
    }
    memset(f,0,sizeof(f));
    fr(i,0,n) fr(j,0,m) fr(k,0,n/2){
        if(i==0) f[i][j][k]=1;
        else if(j){
            add(f[i][j][k],f[i][j-1][k]);
            if(j>1) add(f[i][j][k],1ll*f[i-1][j-2][k]*(j-1)%mod);
            if(k) add(f[i][j][k],1ll*f[i-1][j-1][k-1]*k%mod);
        }
        // cout<<i<<' '<<j<<' '<<k<<' '<<f[i][j][k]<<endl;
    }
    fr(i,0,n/2) fr(j,0,n/2) fr(k,max(i,j),n){
        int x,y;x=n-2*i+j;y=n-2*j+i;
        int val=1ll*f[k-i][x][i]%mod*f[k-j][y][j]%mod;
        if(n+i+j-k*2<0) val=0;
        else val=1ll*val*fac[n+i+j-2*k]%mod;
        tr2[i][j][k]=val;
        // cout<<i<<' '<<j<<' '<<k<<' '<<val<<endl;
    }
    dp1[0]=1;
    fr(i,1,k){
        if(i&1) Trans1();
        else Trans2();
    }
    int ans=0;
    if(k%2==0) fr(i,0,n) add(ans,dp1[i]);
    else fr(i,0,n/2) fr(j,0,n/2) add(ans,dp2[i][j]);
    writeln(ans);
}
signed main(){
    // return system("fc output.out output1.out");
	// freopen("input.in","r",stdin);
	// freopen("output.out","w",stdout);
    init();work();
    // printf("\nTIME:%.3lf",(double)clock()/CLOCKS_PER_SEC);
	return 0;
}