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
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <vector>
#include <set>
#include <map>
#include <array>
#include <random>
#include <cmath>
#include <list>
#include <ctime>
#include <sstream>
#include <queue>
#include <climits>
#include <stack>
#include <random>
#include <bitset>
#include <numeric>
#include <cassert>
using namespace std;
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef long long ll;
#define rep(x, b, e) for(int x=(b); x<(e); ++x)
#define trav(a, x) for(auto& a : x)
#define ford(x, b, e) for(int x=((int)(b))-1; x>=(e); --x)
#define all(c) c.begin(),c.end()
#define sz(x) ((int)((x).size()))
#define pb push_back
#define st first
#define nd second
#define mp(x,y) make_pair(x,y)
typedef short int sint;

#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "

int n, m, P = 1e9 + 7;

int add(int a, int b) {
	a += b;
	if (a >= P) a -= P;
	return a;
}

int sub(int a, int b) {
	a -= b;
	if (a < 0) {
		a += P;
	}
	return a;
}

void print(int iter, const vi& gor, const vi& sumy) {
	return;
	printf("n = %d, m = %d\n", iter, m);
	printf("gor: "); trav(g, gor) printf("%d ", g); printf("\n");
	printf("sum: "); trav(s, sumy) printf("%d ", s); printf("\n");
}

int main() {
	ios_base::sync_with_stdio(false); cin.tie(0);
	// scanf("%d", &n);
	scanf("%d %d %d", &n, &m, &P);
	// scanf("%d %d", &n, &m);
	vi gor(m, 1), sumy(m);
	rep(i, 0, m) {
		sumy[i] = m - i;
	}
	// print(1, gor, sumy);
	rep(k, 2, n + 1) {
		vi ngor(m), nsumy(m);
		ngor[0] = sumy[0];
		nsumy[0] = ngor[0];
		rep(i, 1, m) {
			ngor[i] = add(ngor[i-1], sumy[i]);
			nsumy[0] = add(nsumy[0], ngor[i]);
		}
		int przek = sumy[0];
		rep(i, 1, m) {
			nsumy[i] = sub(nsumy[i-1], przek);
			ll mn = (((ll)m - i)*sumy[m - i]) % P;
			// printf("odejmij: %d, %d * %d\n", przek, m-i, sumy[m - i]);
			nsumy[i] = sub(nsumy[i], mn);
			przek = add(przek, sub(sumy[i], sumy[m - i]));
		}
		gor = ngor; sumy = nsumy;
		// print(k, gor, sumy);
	}
	int res = 0;
	trav(s, sumy) {
		res = add(res, s);
	}
	printf("%d\n", res);
}