1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
#pragma GCC optimize ("Ofast")
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i=(a); i<(b); i++)
#define FORD(i, a, b) for (int i=(a); i>(b); i--)
#define PPC(x) __builtin_popcount(x)
#define MSB(x) (63 - __builtin_clzll(x))
#define SZ(x) ((int)(x).size())
#define HASK(S, x) (S.find(x) != S.end())
#define pb push_back
#define ALL(x) (x).begin(), (x).end()
#define ithBit(m, i) ((m) >> (i) & 1)
#define ft first
#define sd second
#define kw(a) ((a) * (a))
#ifdef DEBUG
#include "debug.h"
#else
#define dbg(...) 0
#endif
using namespace std; 

const int maxN = 11111111;
int mod;

template <typename T1, typename T2> inline void addMod(T1& a, T2 b) { a = (a + b) % mod; }
template <typename T1, typename T2> inline void multMod(T1& a, T2 b) { a = a * b % mod; }

long long dp[2][maxN];

void solve()
{
	int h, w;
	scanf ("%d%d%d", &w, &h, &mod);
	
	#define INV(i) (h+1-(i))
	
	FOR(i, 1, h+1)
		dp[1][i] = i;
	
	FOR(j, 2, w+1)
	{
		long long x = 0, pref = 0;
		long long* prev = dp[(j&1) ^ 1];
		FOR(i, 1, h+1)
		{
			addMod(x, prev[INV(i)] - prev[i-1] + mod);
			long long& tar = dp[j & 1][i];
			tar = x * i % mod;
			addMod(tar, pref);
			addMod(pref, prev[i] * i);
		}
	}
	
	long long res = 0;
	FOR(i, 1, h+1)
		addMod(res, dp[w&1][i]);
	printf("%lld\n", res);
}
 
int main()
{
	int t = 1;
	//scanf ("%d", &t);
	FOR(tid, 1, t+1)
	{
		//printf("Case #%d: ", tid);
		solve();
	}
	return 0;
}