#include <bits/stdc++.h>
#include <atcoder/all>
#include <iostream>
#include <cmath>
#include <boost/multiprecision/cpp_int.hpp>
namespace mpp = boost::multiprecision;
using namespace std;
using namespace atcoder;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
using T = tuple<ll, ll, ll>;
using vll = vector<ll>;
using vb = vector<bool>;
using vvll = vector<vector<ll>>;
using vP = vector<P>;
using Graph = vector<vector<ll>>;
using WGraph = vector<vector<pair<ll, ll>>>; // コスト、頂点番号の順
//using mint = modint998244353;
using mint = static_modint<10007>;
using Bint = mpp::cpp_int; // 多倍長整数
//using mint = long double;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep1(i, n) for (ll i = 1; i <= (ll)(n); i++)
mt19937_64 rng(58);
long double PI = 3.14159265358979;
const ll LLMAX = 9223372036854775807;
const ll INF = 1e18;
vector<ll> di = {-1, 0, 1, 0}; // 上左下右
vector<ll> dj = {0, -1, 0, 1};
template<typename T> inline bool chmax(T &a, T b) { return ((a < b) ? (a = b, true) : (false)); }
template<typename T> inline bool chmin(T &a, T b) { return ((a > b) ? (a = b, true) : (false)); }

int main() {
    ll k, s, n;
    cin >> k >> s >> n;

    vector<mint> f(k + 1);
    f[0] = 1; f[1] = 1;
    rep (i, k - 1) f[i + 2] = f[i] + f[i + 1];
    vector<mint> a(n);
    a[0] = s;
    rep (i, n - 1) {
        rep (j, k + 1) {
            if (i - j >= 0) a[i + 1] += a[i - j] / f[j];
        }
    }
    
    cout << a[n - 1].val() << endl;
    return 0;
}