#include <cstring>
#include <cassert>
#include <fstream>
#include <algorithm>

using namespace std;

int N, M, K;
long long D[92][12][92];

long long gcd(long long A, long long B)
{
	if (B == 0) return A;
	return gcd(B, A % B);
}
long long getR(int nodes, int modul, int prev)
{
	if (nodes == 1 && modul == 0) return 1;
	if (nodes == 1) return 0;
	if (prev == 0) return 0;
	
	long long& now = D[nodes][modul][prev];
	if (now != -1) return now;
	
	now = getR(nodes, modul, prev - 1);
	
	long long COMB, up, down;
	for (int act = 1; act * prev < nodes; ++act)
	{
		if (act == 1)
			COMB = getR(prev, (M + K - 1) % M, prev - 1), up = COMB, down = 1;
		
		now += getR(nodes - prev * act, (M + modul - act) % M, prev - 1) * (prev == 1 ? 1 : COMB);
		assert(now >= 0);
		if (prev != 1)
		{
			++up, ++down;
			long long aup = up / gcd(up, down), adown = down / gcd(up, down);
			COMB = COMB / adown * aup;
		}
	}
	assert(now >= 0);
	return now;
}

int main()
{
	ifstream fin("arbori.in");
	ofstream fout("arbori.out");
	
	memset(D, -1, sizeof(D));
	
	fin >> N >> M >> K;
	fout << getR(N, K, N - 1) << '\n';
	
	fin.close();
	fout.close();
}