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

def modpow(b: int, e: int):
    res = 1
    while e > 0:
        if e & 1 == 1:
            res = res * b % MOD
        b = b * b % MOD
        e >>= 1
    return res

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

def moddiv(v: int, fk: int):
    return v * Finv[fk] % MOD

A = [0] * N
A[0] = S

for n in range(N-1):
    for k in range(0, min(K, n+1)):
        A[n+1] += moddiv(A[n-k], k)
        A[n+1] %= MOD
print(A[N-1])