#include <bits/stdc++.h>
#define N 405
using namespace std;
typedef long long ll;

int n, K, mod;
ll pre[N], inv[N];
ll g[N][N][3], cur[3], f[N][N], tmp[N];

ll pw (ll bs, ll t)
{
    ll res=1;
    while (t) {
        if (t&1) { res=res*bs%mod; }
        bs=bs*bs%mod; t>>=1;
    }
    return res;
}

ll C (ll x, ll y)
{
    ll res=1;
    for (int i=0; i<y; i++) { res=res*(x-i)%mod; }
    res=res*inv[y] %mod;
    return res;
}

int main ()
{
    // freopen("0test.in", "r", stdin);
    // freopen("0test.out", "w", stdout);

    scanf("%d %d %d", &n, &K, &mod);

    for (int j=1; j<=n; j++) {

        for (int w=1; w<j; w++) {
            ll jw1=pw(j-w+1, mod-2), jw=pw(j-w, mod-2), jw_1=pw(j-w-1, mod-2);
            cur[0]=cur[1]=cur[2]=1;
            for (int k=1; k<=n; k++) {
                (cur[0]*=jw1)%=mod;
                (cur[1]*=jw)%=mod;
                (cur[2]*=jw_1)%=mod;
                for (int tg=0; tg<3; tg++) {
                    g[w][k][tg]=g[w][k-1][tg]+f[w][k]*cur[tg] %mod;
                    g[w][k][tg]%=mod;
                }
            }
        }

        for (int w=1; w<j; w++) {
            cur[0]=cur[1]=cur[2]=1;
            for (int i=1; i<=n; i++) {
                (cur[0]*=(j-w+1))%=mod;
                (cur[1]*=(j-w))%=mod;
                (cur[2]*=(j-w-1))%=mod;
                f[j][i]+=g[w][i-1][0]*cur[0] %mod + mod - 2ll*g[w][i-1][1]*cur[1] %mod + g[w][i-1][2]*cur[2] %mod;
                f[j][i]%=mod;
            }
        }

        ll pwj=1, pwj1=1, sum=0;
        for (int i=1; i<=n; i++) {
            pwj=pwj*j %mod; pwj1=pwj1*(mod-1+j) %mod;
            f[j][i]=mod-f[j][i];
            f[j][i]+=pwj+(mod-pwj1)+(mod-sum); f[j][i]%=mod;
            sum=(sum+f[j][i])%mod;

            if (i!=n) {
                for (int k=j; k<=n; k++) {
                    tmp[k]+=mod- f[j][i]*(pw(k-j+1, n-i)+mod-pw(k-j, n-i)) %mod;
                    tmp[k]%=mod;
                }
            }
        }
    }

    pre[0]=1; for (int i=1; i<=n; i++) { pre[i]=pre[i-1]*(ll)i %mod; }
    inv[n]=pw(pre[n], mod-2);
    for (int i=n-1; i>=0; i--) { inv[i]=inv[i+1]*(ll)(i+1) %mod; }

    // for (int i=1; i<=n; i++) { cout<<tmp[i]<<" "; } cout<<endl;

    for (int i=1; i<=n; i++) { tmp[i]+=pw(i, n); tmp[i]%=mod; }
    for (int i=1; i<=n; i++) {
        for (int j=1; j<i; j++) {
            tmp[i]+=mod-tmp[j]*pre[i] %mod *inv[j] %mod *inv[i-j]%mod; tmp[i]%=mod;
        }
    }

    ll ans=0;
    for (int i=1; i<=n; i++) {
        (tmp[i]*=C(K, i))%=mod; ans+=tmp[i]; ans%=mod;
    }
    printf("%lld\n", ans);

    return 0;
}