def solve():
    k,s,n = map(int, input().split())
    MOD = 10007

    fib = [0]*(n+1)
    fib[0] = 1
    fib[1] = 1
    for i in range(2, n+1):
        fib[i] = (fib[i-1]+fib[i-2])%MOD
    invs = [pow(fib[i], -1, MOD) for i in range(n+1)]
    d = [0]*(n+1)
    d[1] = s

    for i in range(2,n+1):
        lenmut = min(i, k+1)
        for j in range(1,lenmut+1):
            d[i] += d[i-j]*invs[j-1]%MOD

    print(d[n]%MOD)



if __name__ == "__main__":
    solve()