K, S, N = map(int, input().split())
MOD = 10007

F = [1, 1] + [0] * (K-1)
Finv = [1, 1] + [0] * (K-1)
for i in range(2, K+1):
    F[i] = (F[i-1] + F[i-2]) % MOD
    Finv[i] = pow(F[i], MOD-2, MOD)

A = [0] * (N+1)
A[1] = S

for i in range(1, N):
    acc = 0
    for j in range(K+1):
        if i - j >= 1:
            acc += (A[i-j] * Finv[j]) % MOD
    A[i+1] = acc % MOD
print(A[N])