#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 n,m,mod;
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 inum[Maxn];
int pw[Maxn][Maxn],ipw[Maxn][Maxn],C[Maxn][Maxn];
inline void into(){
    inum[0]=1;fr(i,1,n) inum[i]=ksm(i);
    // fr(i,1,n) cout<<i<<' '<<inum[i]<<endl;
    fr(i,1,n){
        pw[i][0]=1;
        ipw[i][0]=1;
        fr(j,1,n){
            pw[i][j]=1ll*pw[i][j-1]*i%mod;
            ipw[i][j]=1ll*ipw[i][j-1]*inum[i]%mod;
        }
    }
    C[0][0]=1;
    fr(i,1,n){
        C[i][0]=1;
        fr(j,1,i) C[i][j]=(C[i-1][j]+C[i-1][j-1])%mod;
    }
}
inline void add(int &x,int y){x+=y;if(x>=mod) x-=mod;}
inline void init(){
    n=read();m=read();mod=read();into();
}
int f[Maxn][Maxn],s[Maxn][2];
int g[Maxn];
inline void work(){
    fr(j,1,n){
        fr(i,1,n) s[i][0]=s[i][1]=0;
        fr(i,1,n){
            f[i][j]=pw[j][i];
            fr(t,1,j){
                // cout<<"*"<<i<<' '<<j<<' '<<s[t][0]<<' '<<s[t][1]<<endl;
                add(f[i][j],mod-1ll*pw[t][i]*s[t][0]%mod);
                add(f[i][j],1ll*pw[t-1][i]*s[t][1]%mod);
            }
            // cout<<i<<' '<<j<<' '<<f[i][j]<<endl;
            fr(t,1,j){
                add(s[t][0],1ll*ipw[t][i]*(f[i][j-t+1]-f[i][j-t]+mod)%mod);
                add(s[t][1],1ll*ipw[t-1][i]*(f[i][j-t+1]-f[i][j-t]+mod)%mod);
            }
        }
    }
    int ans=0,s=1;
    // fr(i,1,n) fr(j,1,n) cout<<i<<' '<<j<<' '<<f[i][j]<<endl;
    fr(i,1,n){
        g[i]=f[n][i];
        fr(j,1,i-1) add(g[i],mod-1ll*g[j]*C[i][j]%mod);
        s=1ll*s*(m-i+1)%mod;s=1ll*s*inum[i]%mod;
        // cout<<i<<' '<<g[i]<<endl;
        add(ans,1ll*s*g[i]%mod);
    }writeln(ans);
}
signed main(){
	// freopen("input.in","r",stdin);
	// freopen("output.out","w",stdout);
    init();work();
    // printf("\nTIME:%.3lf",(double)clock()/CLOCKS_PER_SEC);
	return 0;
}