mod = 10007

k, s, n = map(lambda s_: int(s_), input().split())
fib = [1] * (n + 5)
fib[1] = 1
for i in range(2, n + 5):
    fib[i] = (fib[i - 1] + fib[i - 2]) % mod
    if fib[i] == 0:
        print(i)
fi = [pow(e, -1, mod) for e in fib[:n]]
ans = [0] * n
ans[0] = s
for i in range(1, n):
    ans[i] = sum(fi[j] * ans[i - 1 - j] %
                 mod for j in range(min(k + 1, i))) % mod
print(ans[-1])