from sys import stdin
input = stdin.readline

def solve():
    K,S,N = map(int, input().rstrip().split())

    MOD = 10007
    
    # フィボナッチ数列の前計算
    F = [0] * (K + 1)
    F[0] = 1
    if K >= 1:
        F[1] = 1
    
    for i in range(2, K + 1):
        F[i] = (F[i-1] + F[i-2]) % MOD
        
    # modular inverseの計算
    # 10007は素数であるため、フェルマーの小定理 a^(p-2) = a^-1 (mod p) を利用できる！
    invF = [pow(f, MOD - 2, MOD) for f in F]

    # DP
    A = [0] * (N + 1)
    A[1] = S
    
    for i in range(2, N + 1):
        res = 0
        lim = K if K < i - 2 else i - 2
        
        for j in range(lim + 1):
            res += A[i - 1 - j] * invF[j]
            
        A[i] = res % MOD

    print(A[N])

if __name__ == "__main__":
    solve()