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

MOD = 10007

F = [1,1]
while len(F) <= N:
    F.append((F[-2] + F[-1]) % MOD)

invF = [pow(f,-1,MOD) for f in F]

A = [S]
for _ in range(N-1):
    now = 0
    for i in range(K+1):
        if -1-i < -len(A): break
        now += invF[i] * A[-1-i]
        now %= MOD
    A.append(now)
print(A[-1])