#include<bits/stdc++.h>
#include<atcoder/modint>
using namespace std;

int main(){
	using mint=atcoder::modint;
	mint::set_mod(10007);
	int k,s,n;
	cin>>k>>s>>n;
	vector<mint> fib(k+1);
	fib[0]=fib[1]=1;
	for (int i=2;i<=k;i++) fib[i]=fib[i-1]+fib[i-2];
	vector<mint> val(n);
	val[0]=s;
	for (int i=0;i<n-1;i++){
		for (int j=0;j<=k;j++){
			if (i-j>=0) val[i+1]+=val[i-j]*(fib[j]).inv();
		}
	}
	cout<<val[n-1].val()<<endl;
}