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

MOD = 10**4+7

def inverse(n, d):
    return n * pow(d, -1, MOD) % MOD

F = [1, 1]
for _ in range(K-1):
    F.append((F[-1]+F[-2])%MOD)
for i in range(len(F)):
    F[i] = inverse(1, F[i])

A = [S]
for i in range(N-1):
    SUM = 0
    for j in range(max(len(A)-K-1, 0), len(A)):
        SUM += A[j]*F[i-j]%MOD
        SUM %= MOD
    A.append(SUM)

print(A[-1])