#include <bits/stdc++.h>
#include <algorithm>
#include <cctype>
#include <climits>
#include <functional>
#include <iomanip>
#include <queue>
#include <set>
#include <valarray>
#define ll long long
#define ull unsigned long long
#define mp make_pair
#define fi first
#define se second
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pb push_back
#define rep(a, b, c) for (int a = b; a <= c; a++)
#define per(a, b, c) for (int a = c; a >= b; a--)
#define all(a) a.begin() + 1, a.end()
#define all_(a) a.begin(), a.end()
#define vi vector<int>
#define vl vector<ll>
#define vpii vector<pii>
#define vpll vector<pll>
int mod = 998244353;
ll gcd(ll a, ll b) {return b == 0 ? a : gcd(b, a % b);}
ll lcm(ll a, ll b) {return a / gcd(a, b) * b;}
ll fp_m (ll a, ll n) {
    a %= mod;
    ll res = 1; while (n) { if (n & 1) res = res * a % mod; a = a * a % mod; n >>= 1; } return res;
}
ll fp (ll a, ll n) {
    ll res = 1; while (n) { if (n & 1) res *= a; a *= a; n >>= 1; } return res;
}
ll inv(ll x) {return fp_m(x, mod - 2);}
template<typename T>
std::ostream& operator<<(std::ostream& os, const std::vector<T>& vec) {
    os << "[";
    for (size_t i = 0; i < vec.size(); ++i) {
        os << vec[i];
        if (i < vec.size() - 1)
            os << ", ";
    }
    os << "]";
    return os;
}
template<typename T, typename... Args>
void debug(std::string name, T value, Args &&...arg) {
    std::cout << name;
    (..., (std::cout << '[' << arg << ']'));
    std::cout << " = " << value << '\n';
}
//中文测试 中文测试
signed main()   {
    std::ios::sync_with_stdio(0);
    std::cin.tie(0); std::cout.tie(0);
    int n, p, m; std::cin >> n >> p >> m;
    mod = m;
    // dp[i][j][k] for (i item) (j xor sum) (k last value) : ways
    // dp[i + nk][j ^ nk][nk] += dp[i][j][k] (nk >= k)
    std::vector dp(n + 1, std::vector(512, std::vector<long long>(n + 1)));
    dp[0][0][0] = 1;
    // note that xor sum <= value sum
    // note that A xor B >= A - B
    for (int i = 0; i <= n - p; i++) {
        for (int j = 0; j <= i; j++) {
            if (j - (n - p - i) > p || j + (n - p - i) < p) continue;
            for (int k = 0; k <= i; k++) {
                if (dp[i][j][k] != 0) {
                    for (int nk = std::max(1, k); i + nk <= n - p; nk++) {
                        dp[i + nk][j ^ nk][nk] = (dp[i + nk][j ^ nk][nk] + dp[i][j][k]) % mod;
                    }
                }
                // debug("dp", dp[i][j][k], i, j, k);
            }
        }
    }
    long long ans = 0;
    for (int i = 1; i <= n; i++) {
        ans = (ans + dp[n - p][p][i]) % mod;
    }
    std::cout << ans << '\n';
    return 0;
}


/*
1 2 3 4 5 6
[1, 1]
[2, 2]
[3, 3]
[4, 2]
[5, 1]
[6, 1]

*/