#include <bits/stdc++.h>
#include <atcoder/math>
using namespace std;
using atcoder::inv_mod;
const int MOD = 10007;

int main(){
    int K, S, N;
    cin >> K >> S >> N;
    vector<int> F(K + 1);
    F[0] = 1, F[1] = 1;

    for (int i = 2; i <= K; i++){
        F[i] = (F[i-1]+F[i-2])%MOD;
    }

    vector<int> A(N + 1);
    A[1] = S;
    for (int i = 2; i <= N; i++){
        for (int j = 0; j <= K; j++){
            if (i-j >= 2){
                A[i] += A[i-j-1]*inv_mod(F[j], MOD)%MOD;
                A[i] %= MOD;
            }
        }
    }

    cout << A[N] << endl;
}