#include <bits/stdc++.h>

#define p pair <int, int>
#define s second
#define f first
#define ll long long

using namespace std;

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    int n, m, k;
    cin >> k >> n >> m;
    vector <vector <int>> dp(n + 1, vector <int> (k + 1));
    vector <int> sum(k + 1);
    for (int i = 0; i < n; i++) dp[i][1] = i;
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= k; j++) {
            dp[i][j] = (dp[i - 1][j] + sum[j - 1]) % m;
            if (i % 4 == 0) dp[i][j] = (dp[i][j] - dp[i - 4][j - 1] + m) % m;
            if (i % 2 == 0) dp[i][j] = (dp[i][j] - dp[i - 2][j - 1] + m) % m;
            sum[j] += dp[i][j];
        }
    }
    cout << dp[n][k];
    return 0;
}