n,d,K = map(int,input().split())
dp = [0]*(K+1)
dp[0] = 1
mod = 10**9+7

for i in range(n):
    ndp = [0]*(K+1)
    for j in range(K):
        for k in range(1,d+1):
            if j+k <= K:
                ndp[j+k] += dp[j]
                ndp[j+k] %= mod
    dp = ndp[:]

print(dp[K])