#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)

#include <atcoder/modint>
using mint = atcoder::static_modint<10007>;

int main() {
    int k, s, n;
    vector<mint> f(501, 1);
    rep(i, 499) f[i + 2] = f[i + 1] + f[i];
    cin >> k >> s >> n;
    vector<mint> dp(n, 0);
    dp[0] = s;
    for (int i = 0; i < n - 1; i++) {
        rep(j, k + 1) {
            if (i - j < 0)
                continue;
            dp[i + 1] += dp[i - j] * f[j].inv();
        }
    }
    cout << dp.back().val() << endl;
    return 0;
}