#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstdlib>
#include<cstring>
#include<algorithm>
using namespace std;
#define ll long long
#define N 60
char getc(){char c=getchar();while ((c<'A'||c>'Z')&&(c<'a'||c>'z')&&(c<'0'||c>'9')) c=getchar();return c;}
int gcd(int n,int m){return m==0?n:gcd(m,n%m);}
int read()
{int x=0,f=1;char c=getchar();while (c<'0'||c>'9') {if (c=='-') f=-1;c=getchar();}while (c>='0'&&c<='9') x=(x<<1)+(x<<3)+(c^48),c=getchar();return x*f;
}
int n,c,P,a[N],b[N],fac[N],inv[N],id[N][N],nxt[N*N],f[N],g[N][N],ans,T;
bool flag[N*N];
int ksm(int a,int k)
{int s=1;for (;k;k>>=1,a=1ll*a*a%P) if (k&1) s=1ll*s*a%P;return s;
}
int C(int n,int m){return 1ll*fac[n]*inv[m]%P*inv[n-m]%P;}
int calc(int m)
{int s=1,tot=n;for (int i=1;i<=m;i++){int t=i;while (t<m&&a[t+1]==a[i]) t++;s=1ll*s*inv[t-i+1]%P;for (int j=i;j<=t;j++)s=1ll*s*C(tot,a[j])%P*fac[a[j]-1]%P,tot-=a[j];i=t;}tot=0;for (int i=1;i<=m;i++) tot=(tot+f[a[i]])%P;for (int i=1;i<=m;i++)for (int j=i+1;j<=m;j++)tot=(tot+g[a[i]][a[j]])%P;return 1ll*s*ksm(c,tot)%P;
}
void dfs(int k,int n,int last)
{if (n==0) ans=(ans+calc(k-1))%P;if (n<last) return;for (int i=last;i<=n;i++)a[k]=i,dfs(k+1,n-i,i);
}
int cycle()
{int tot=0;memset(flag,0,T+1);for (int i=1;i<=T;i++)if (!flag[i]){int x=nxt[i];flag[i]=1;tot++;while (x!=i) flag[x]=1,x=nxt[x];}return tot;
}
int main()
{
#ifndef ONLINE_JUDGEfreopen("bzoj1815.in","r",stdin);freopen("bzoj1815.out","w",stdout);const char LL[]="%I64d\n";
#elseconst char LL[]="%lld\n";
#endifn=read(),c=read(),P=read();fac[0]=1;for (int i=1;i<=n;i++) fac[i]=1ll*fac[i-1]*i%P;inv[0]=inv[1]=1;for (int i=2;i<=n;i++) inv[i]=P-1ll*(P/i)*inv[P%i]%P;for (int i=2;i<=n;i++) inv[i]=1ll*inv[i-1]*inv[i]%P;for (int i=1;i<=n;i++){T=0;for (int x=1;x<=i;x++)for (int y=x+1;y<=i;y++)id[x][y]=id[y][x]=++T;for (int x=1;x<=i;x++)for (int y=x+1;y<=i;y++) nxt[id[x][y]]=id[x%i+1][y%i+1];f[i]=cycle();}for (int i=1;i<=n;i++)for (int j=i;j<=n;j++){T=0;for (int x=1;x<=i;x++)for (int y=1;y<=j;y++)id[x][y]=++T;for (int x=1;x<=i;x++)for (int y=1;y<=j;y++)nxt[id[x][y]]=id[x%i+1][y%j+1];g[i][j]=g[j][i]=cycle();}dfs(1,n,1);cout<<1ll*ans*inv[n]%P;return 0;
}