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
 96
 97
 98
 99
100
101
102
103
104
105
#include <bits/stdc++.h>
using namespace std;

#define REP(i, n) for (int i = 0; i < (int)n; i++)
#define ST first
#define ND second
#define MP make_pair
#define PB push_back

typedef vector<int> VI;
typedef pair<int, int> PII;
typedef vector<PII> VPII;
typedef set<int> SI;
typedef long long LL;

#ifdef DEBUG
const bool debug = true;
#else
const bool debug = false;
#endif

// #define MULTI_TASK true

const int INF = 1000 * 1000 * 1000;
const LL INFLL = 1e18;
const int MAKSN = 1000 * 1000 + 13;
const LL MOD = 123456789LL;
LL N, M, k, l, a, b, c, d, p;
vector<LL> v;

void zeruj() {
    v.clear();
}

void readIn() {
    cin >> N >> M >> p;
}

LL pls(LL a, LL b) {
    return (a + b) % p;
}

bool intersects(int a, int b, int c, int d) {
    return max(a, c) <= min(b, d);
}

void solve() {
    vector<vector<LL>> last, cur;

    for (int i = 0; i < M; i++) {
        cur.push_back(vector<LL>());
        for (int j = 0; j < M; j++) {
            cur[i].push_back(0);
            if (j >= i)
                cur[i].back() = 1;
        }
    }

    for (int it = 1; it < N; it++) {
        last = cur;

        for (int i = 0; i < M; i++) {
            for (int j = i; j < M; j++) {
                cur[i][j] = 0;
            }
        }

        for (int i = 0; i < M; i++) {
            for (int j = i; j < M; j++) {
                for (int k = 0; k < M; k++) {
                    for (int l = max(i, k); l < M; l++) {
                        if (intersects(i, j, k, l)) {
                            cur[i][j] = pls(cur[i][j], last[k][l]);
                        }
                    }
                }
            }
        }
    }

    LL res = 0;
    for (int i = 0; i < (int)cur.size(); i++) {
        for (int j = 0; j < (int)cur[i].size(); j++) {
            res = pls(res, cur[i][j]);
        }
    }

    cout << res << "\n";
}

int main() {
    ios_base::sync_with_stdio(0);
#ifdef MULTI_TASK
    int test;
    cin >> test;
    while (test--) {
#endif
        zeruj();
        readIn();
        solve();
#ifdef MULTI_TASK
    }
#endif
    return 0;
}