#include<bits/stdc++.h>
#define Gc() getchar()
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define eb emplace_back
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;
const int N=3e3+5,M=200+5,K=(1<<25)+5,mod=998244353,Mod=mod-1;const db eps=1e-9;const int INF=1e9+7;mt19937 rnd(time(0));
int n,m,p;
ll f[N];
void Solve(){
	int i,j;scanf("%d%d%d",&n,&m,&p);
	f[0]=1;f[1]=m+1;
	for(i=2;i<=n;i++) f[i]=(f[i-1]+f[i-2]*m)%p;
	ll ans=f[n];
	for(i=1;i<=n;i++){
		for(j=i+1;j<=n;j++){
			ans+=(j-i+1)/2*m*(i^2?f[max(i-4,0)]*(i^1?m:1)%p:0)%p*(j^n-1?f[max(n-j-3,0)]*(j^n?m:1)%p:0)%p;
		} 
	}
	for(i=1;i<=n;i++) ans+=(m-1)*m/2*f[max(i-2,0)]%p*f[max(n-i-1,0)]%p;
	ll w=0;for(i=1;i<=m;i++) w+=1ll*(m-i)*(m-i)%p*(m-i)%p;w%=p;
	cerr<<ans<<'\n';
	for(i=1;i<=n;i++){
		for(j=i+4;j<=n;j+=2) ans-=w*f[max(i-2,0)]%p*f[max(n-j-1,0)]%p;
	}
	cerr<<ans<<'\n';
	w=0;for(i=1;i<=m;i++) w+=1ll*(m-i)*(m-i);w%=p;
	for(i=3;i<=n;i+=2) ans-=w*f[max(n-i-1,0)]%p;
	for(i=n-2;i>=1;i-=2) ans-=w*f[max(i-2,0)]%p;
	w=0;for(i=1;i<=m;i++) w+=m-i;w%=p;
	if(n&1) ans-=w;
	printf("%lld\n",(ans%p+p)%p);
}
int main(){
	int t=1;
	// scanf("%d",&t);
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}