mod = 10007
k, s, n = list(map(int, input().split()))
dp = [0] * n
dp[0] = s
A = [1, 1]
for _ in range(1000):
    A.append((A[-2]+A[-1]) % mod)
B = [pow(a, -1, mod) for a in A]
for i in range(n):
    now = dp[i]
    for j in range(i+1, i+k+2):
        if n <= j:
            break
        dp[j] = (dp[j] + B[j-i-1] * now) % mod
print(dp[-1])