#include <bits/stdc++.h>
using namespace std;
#include <atcoder/modint>
using namespace atcoder;
using mint = modint;

#define rep(i, a, b) for (int i = a; i < b; i++)
using ll = long long;

int main(){
	int k, s, n;
	cin >> k >> s >> n;
	mint::set_mod(10007);
	vector<mint> f(k + 1), rf(k + 1);
	f[0] = f[1] = 1;
	rep(i, 2, k + 1) f[i] = f[i - 1] + f[i - 2];
	rep(i, 0, k + 1) rf[i] = f[i].inv();
	vector<mint> a(n + 1);
	a[1] = s;
	rep(i, 2, n + 1) {
		int l = 0;
		for(int j = i - 1; j > 0; j--) {
			a[i] += a[j] * rf[l];
			l++;
			if(l > k) break;
		}
	}
	cout << a[n].val() << endl;
}