1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;

const LL MOD = 1e9 + 7;
LL n, k, m, invk;
map<pair<LL, deque<LL>>, LL>mapa;

LL exp(LL a, LL b=MOD-2) {
	LL res = 1;
	while (b) {
		if (b & 1) {
			res = (res * a) % MOD;
		}
		b >>= 1;
		a = (a * a) % MOD;
	}
	return res;
}

LL f(LL pozostalo, deque<LL> &dq){
	LL res = 1;
	while (!dq.empty() && dq.front() == 0) {
		dq.pop_front();
		pozostalo--;
	}
	if(pozostalo<=0){
		return 0;
	}
	auto it = mapa.find({pozostalo, dq});
	if(it != mapa.end()){
		return it->second;
	}
	for(int i=1; i<=k; i++){
		if(i >= pozostalo)continue;
		LL pozostalo2 = pozostalo;
		deque<LL> v = dq;
		v[0]--;
		if ((int)v.size() <= i){
			v.resize(i+1, 0);
		}
		v[i]++;		
		res = (res+f(pozostalo2, v)*invk) % MOD;
	}
	mapa[{pozostalo, dq}] = res;
	return res;
}

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	cin>>n>>k>>m;
	invk = exp(k);
	deque<LL> dq(1, n);
	
	cout<<f(m, dq)%MOD<<"\n";
	
	return 0;
}