// Author: Olaf Surgut (surgutti)
// Created on 01-10-2024 13:41:45
#include <bits/stdc++.h>
using namespace std;

#ifdef DEBUG
auto&operator<<(auto&o,pair<auto,auto>p){return o<<"("<<p.first<<", "<<p.second<<")";}
auto operator<<(auto&o,auto x)->decltype(x.end(),o){o<<"{";int i=0;for(auto e:x)o<<","+!i++<<e;return o<<"}";}
#define debug(X...)cerr<<"["#X"]: ",[](auto...$){((cerr<<$<<"; "),...)<<endl;}(X)
#else
#define debug(...){}
#endif

#define endl '\n'
#define st first
#define nd second
#define pb push_bask
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define ROF(i, b, a) for (int i = (b); i >= (a); i--)
#define REP(i, n) for (int i = 0; i < (n); i++)

const int N = 500 + 7;

int dp[2][2 * N][N];
signed main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);

	int n, p, m;
	cin >> n >> p >> m;
	
	int bits = 1;
	while (bits <= max(p, n - p))
		bits <<= 1;

	dp[0][p][n - p] = 1;
	
	debug(bits);

	FOR(i, 1, n - p) {
		int a = i & 1;
		int b = a ^ 1;

		REP(x, bits) FOR(j, 0, n - p)
			dp[a][x][j] = 0;

		debug(i, a, b);

		FOR(j, 0, n - p) {
			for (int k = 0; i * k <= j; k++) {
				if (k % 2 == 0) {
					REP(x, bits) {
						int& X = dp[a][x][j - k * i];
						X += dp[b][x][j];
						if (X >= m)
							X -= m;
					}
				}
				else {
					REP(x, bits) {
						int& X = dp[a][x ^ i][j - k * i];
						X += dp[b][x][j];
						if (X >= m)
							X -= m;
					}
				}
			}
		}
	}

	cout << dp[(n - p) & 1][0][0] << '\n';

	return 0;
}