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

def modpow(b: int, e: int):
    res = 1
    # 10005
    res = res * b % MOD
    b = b *b % MOD
    # 5002
    b = b *b % MOD
    # 2501
    res = res * b % MOD
    b = b *b % MOD
    # 1250
    b = b *b % MOD
    # 625
    res = res * b % MOD
    b = b *b % MOD
    # 312
    b = b *b % MOD
    # 156
    b = b *b % MOD
    # 78
    b = b *b % MOD
    # 39
    res = res * b % MOD
    b = b *b % MOD
    # 19
    res = res * b % MOD
    b = b *b % MOD
    # 9
    res = res * b % MOD
    b = b *b % MOD
    # 4
    b = b *b % MOD
    # 2
    b = b *b % MOD
    # 1
    res = res * b % MOD
    b = b *b % MOD
    

    # 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)

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

for n in range(K):
    acc = 0
    for k in range(0, n+1):
        acc = (acc + A[n-k] * Finv[k]) % MOD
    A[n+1] = acc

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