#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <utility>
#include <string>
#include <queue>
#include <stack>
#include <unordered_set>
#include <unordered_map>

using namespace std;

typedef long long int ll;
typedef pair<int, int> Pii;

const ll mod = 10007;

ll modinv(ll x, ll m = mod) {
  ll b = m;
  ll u = 1;
  ll v = 0;
  ll tmp;
  while (b) {
    ll t = x / b;
    x -= t * b;
    tmp = x;
    x = b;
    b = tmp;
    u -= t * v;
    tmp = u;
    u = v;
    v = tmp;
  }
  u %= m;
  if (u < 0) u += m;
  return u;
}

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

  ll k, s, n;
  cin >> k >> s >> n;

  vector<ll> fib(k + 1);
  fib[0] = 1;
  fib[1] = 1;
  for (int i = 2; i <= k; i++) {
    fib[i] = (fib[i - 2] + fib[i - 1]) % mod;
  }

  vector<ll> num(n);
  vector<ll> denom(n);
  num[0] = s;
  denom[0] = 1;
  for (int i = 1; i < n; i++) {
    num[i] = 0;
    denom[i] = 1;
    for (int j = 0; j <= k; j++) {
      int idx = i - j - 1;
      if (idx < 0) break;
      num[i] = (num[idx] * denom[i] + num[i] * denom[idx] * fib[j]) % mod;
      denom[i] = (denom[idx] * denom[i] * fib[j]) % mod;
    }
  }

  ll ans = (num[n - 1] * modinv(denom[n - 1])) % mod;

  cout << ans << endl;

  return 0;
}