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(K-2):
    F[i+2] = (F[i] + F[i+1]) % MOD
    Finv[i+2] = pow(F[i+2], MOD-2, MOD)

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

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