#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define endl '\n'
#define debug(x) cout<<#x<<": "<<x<<endl
#define rep(i, a, b) for(int i = (a); i <= (b); i++)
const ll mod=1e9+7;
const ll N=505;

int n, p, m;
int dp[N][N][N];



void solve()
{
	cin >> n >> p >> m;
	dp[0][n - p][p] = 1;
	rep(i, 1, n) {
		rep(j, 0, n) {
			rep(k, 0, n) {
				rep(l, 0, j / i) {
					if(l & 1) dp[i][j - i * l][k] = (dp[i][j - i * l][k] + dp[i - 1][j][k ^ i]) % m;
					else dp[i][j - i * l][k] = (dp[i][j - i * l][k] + dp[i - 1][j][k]) % m;
				}
			}
		}
	}
	cout << dp[n][0][0];
}

int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0),cout.tie(0);
	
	int T=1;
	//cin>>T;

	while(T--)
	{
		solve();
	}

	return 0;
}