// #include <bits/stdc++.h>
#include <iostream>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <queue>
#include <algorithm>
#include <cassert>
#include <functional>
#include <numeric>
#include <iomanip>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll,ll> PP;
// #define MOD 1000000007
// #define MOD 998244353
#define MOD 10007
#define INF 2305843009213693951ll
#define PI 3.141592653589
#define setdouble setprecision
#define REP(i,n) for(ll i=0;i<(n);++i)
#define OREP(i,n) for(ll i=1;i<=(n);++i)
#define RREP(i,n) for(ll i=(n)-1;i>=0;--i)
#define ORREP(i,n) for(ll i=(n);i>=1;--i)
#define rep(i,a,b) for(ll i=(a);i<=(b);++i)
#define ALL(v) (v).begin(), (v).end()
#define chmin(k,m) k = min(k,m)
#define chmax(k,m) k = max(k,m)
#define GOODBYE do { cout << "-1" << endl; return 0; } while (false)
#define MM <<" "<<
#define Endl endl

long long inverse(long long b){
    // Copyright (c) 2023 0214sh7
    // https://github.com/0214sh7/library/
    long long r=1,e=MOD-2;
    while(e){
        if(e&1){
            r=(r*b)%MOD;
        }
        b=(b*b)%MOD;
        e >>=1;
    }
    return r;
}

int main(void){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    ll K,S,N;
    cin >> K >> S >> N;

    vector<ll> F(K+10,0);
    F[0]=1;
    F[1]=1;
    REP(i,K+8){
        F[i+2] = (F[i]+F[i+1])%MOD;
    }

    vector<ll> Finv(K+10);
    REP(i,K+10){
        Finv[i] = inverse(F[i]);
    }

    // S は最後まで使わない
    vector<ll> V(N+1,0);
    V[1] = 1;

    for(ll i=1;i<N;i++){
        ll sum = 0;
        REP(k,K+1){
            if(i-k<=0)break;
            sum += (V[i-k]*Finv[k])%MOD;
            sum %= MOD;
        }
        V[i+1] = sum;
    }

    ll Ans = (V[N]*S)%MOD;
    cout << Ans << endl;


    return 0;
    
}