#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

struct Comb
{
  std::vector<long long> fac, finv, inv;
  const int mod;
  Comb(const int max, const int m) : mod(m), fac(max + 5), finv(max + 5), inv(max + 5)
  {
    fac[0] = fac[1] = finv[0] = finv[1] = inv[1] = 1;
    for (int i = 2; i < max + 5; ++i)
    {
      fac[i] = fac[i - 1] * i % mod;
      inv[i] = mod - inv[mod % i] * (mod / i) % mod;
      finv[i] = finv[i - 1] * inv[i] % mod;
    }
  }
  long long c(int n, int k)
  {
    if (n < k || n < 0 || k < 0) return 0;
    return fac[n] * (finv[k] * finv[n - k] % mod) % mod;
  }
  long long p(int n, int k)
  {
    if (n < k || n < 0 || k < 0) return 0;
    return fac[n] * finv[n - k] % mod;
  }
};

int main()
{
  const int mod = 10007;
  int k, s, n;
  cin >> k >> s >> n;
  Comb cb(n + 100, mod);
  vector<long long> f(n + 100);
  f[0] = f[1] = 1;
  for (int i = 2; i < n + 100; ++i) f[i] = (f[i - 1] + f[i - 2]) % mod;
  vector<long long> a(n + 1);
  a[1] = s;
  for (int i = 1; i < n; ++i)
  {
    for (int j = 0; j <= k && i - j >= 0; ++j)
    {
      a[i + 1] = (a[i + 1] + a[i - j] * cb.inv[f[j]]) % mod;
    }
  }
  cout << a[n] << endl;
}