#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
// using mint = modint1000000007;
// const int mod = 1000000007;
// using mint = modint998244353;
// const int mod = 998244353;
// const int INF = 1e9;
// const long long LINF = 1e18;
using mint = atcoder::modint;
int mod;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i, l, r) for (int i = (l); i < (r); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)
#define rrep2(i, l, r) for (int i = (r)-1; i >= (l); --i)
#define all(x) (x).begin(), (x).end()
#define allR(x) (x).rbegin(), (x).rend()
#define P pair<int, int>
template<typename A, typename B> inline bool chmax(A &a, const B &b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A &a, const B &b) { if (a > b) { a = b; return true; } return false; }

int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	int k, s, n; cin >> k >> s >> n;
	mod = 10007;
	mint::set_mod(mod);
	vector<mint>f(k + 2);
	vector<mint>finv(k + 2);
	f[0] = finv[0] = 1;
	f[1] = finv[1] = 1;
	rep2(i, 2, k + 2) {
		f[i] = f[i - 1] + f[i - 2];
		finv[i] = f[i].inv();
	}
	vector<mint>a(n + 1);
	a[1] = s;
	rep2(i, 2, n + 1) {
		rep2(j, 1, k + 2) {
			int i2 = i - j;
			if (i2 <= 0)continue;
			a[i] += a[i2] * finv[j - 1];
		}
	}
	cout << a[n].val() << endl;
	return 0;
}
// 0 1 2 3
// 1 1 2 3