#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using mint = modint;
//using mint = modint1000000007;
typedef long long ll;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> T;
template<typename T>bool chmax(T& a, const T& b) { if (a < b) { a = b;return true; } else { return false; } }
template<typename T>bool chmin(T& a, const T& b) { if (a > b) { a = b;return true; } else { return false; } }
template<class... Args> void dbg(Args&&... args) { ((cout << args << ' '), ...);cout << '\n'; }

const int di[] = { -1,0,1,0 };
const int dj[] = { 0,-1,0,1 };
const long long INF = 6000000000000000000;
const int inf = 1001001001;


int main(void) {
    int k, s, n; cin >> k >> s >> n;
    mint::set_mod(10007);
    vector<mint> fib(k + 9);
    for (int i = 0; i < k + 9; i++) {
        if (i == 0 || i == 1)fib[i] = 1;
        else fib[i] = fib[i - 1] + fib[i - 2];
    }
    vector<mint> a(n + 9, 0);
    a[1] = s;
    for (int i = 2; i <= n; i++) {
        for (int j = 0; j <= k; j++) {
            if (i - j >= 1) {
                a[i] += a[i - j - 1] / fib[j];
                // if (i == 4)dbg(i, j, (a[i - j - 1] / fib[j]).val());
            }
        }
    }
    // for (int i = 1; i <= n; i++) {
    //     dbg(a[i].val());
    // }
    cout << a[n].val() << "\n";

}