#include<bits/stdc++.h>
#define L(i, j, k) for(int i = (j); i <= (k); ++i)
#define R(i, j, k) for(int i = (j); i >= (k); --i)
#define ll long long
#define sz(a) ((int) (a).size())
#define vi vector < int >
#define me(a, x) memset(a, x, sizeof(a))
#define ull unsigned long long
#define ld __float128
#define pb emplace_back
using namespace std;
const int N = 1e6 + 7;
int n, m, mod;
int qpow(int x, int y = mod - 2) {
	int res = 1;
	for(; y; x = (ll) x * x % mod, y >>= 1) if(y & 1) res = (ll) res * x % mod;
	return res;
}
int fac[N], ifac[N], inv[N];
void init(int x) {
	fac[0] = ifac[0] = inv[1] = 1;
	L(i, 2, x) inv[i] = (ll) (mod - mod / i) * inv[mod % i] % mod;
	L(i, 1, x) fac[i] = (ll) fac[i - 1] * i % mod, ifac[i] = (ll) ifac[i - 1] * inv[i] % mod;
} 
int C(int x, int y) {
	return x < y || y < 0 ? 0 : (ll) fac[x] * ifac[y] % mod * ifac[x - y] % mod;
}
inline int sgn(int x) {
	return (x & 1) ? mod - 1 : 1;
}
int fan[N];
int ff[N];
int dp[N]; 
int rat[N];
int main() {
	ios :: sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	cin >> n >> m >> mod;
//	n = 4, m = 2, mod = 998244353;
	
	dp[0] = 1;
	int ans = 0;
	L(i, 1, n) {
		dp[i] = dp[i - 1], (dp[i] += (ll)dp[max(i - 2, 0)] * m % mod) %= mod;
	}
	(ans += dp[n]) %= mod;
	
	int all_case = 0;
	L(i, 2, n - 1) 
		(all_case += (ll)dp[i - 2] * dp[n - i - 1] % mod) %= mod;
	(all_case += (ll)2 * dp[n - 2] % mod) %= mod;
	
	L(i, 1, m) 
		(ans += (ll)all_case * (m - i) % mod) %= mod;
	
	L(i, 0, n) 
		rat[i] = dp[max(i - 1, 0)];
	L(i, 0, n) 
		L(j, 0, n - i) 
			(fan[i + j] += (ll)rat[i] * rat[j] % mod) %= mod;
	L(i, 0, n) 
		L(j, 0, n - i)	
			(ff[i + j] += (ll)dp[i] * dp[j] % mod) %= mod;
	
	L(i, 1, m) {
		int bad = 0;
		L(ls, 1, n) {
			int len = ls * 2 - 1;
			if(len == n) {
				(bad += 1) %= mod;
			} else {
				int qls = len + 4;
				if(qls <= n) 
					(bad += (ll) fan[n - qls] * (m - i) % mod * (m - i) % mod) %= mod;
				if(len + 2 <= n) {
					(bad += (ll) rat[n - (len + 2)] * (m - i) * 2 % mod) %= mod;
				}
			}
		}
//		cout << i << " : bad = " << bad << ", all_case = " << all_case << endl; 
		(ans += mod - (ll)bad * (m - i) % mod) %= mod;
	}
	
	int cnt = 1;
	L(s, 4, n) 
		(cnt += (ll)sgn(s) * ff[n - s] % mod) %= mod;
//	cout << "cnt = " << cnt << endl;
	
	for(int len = 3; len < n; len += 2) 
		(cnt += (ll)rat[n - len - 1] * m % mod * 2 % mod) %= mod;
	
	(ans += (ll)cnt * m % mod) %= mod;
	
	cout << ans << '\n';
	return 0;
}