mod = 10 ** 9 + 7

n,d,k = map(int,input().split())

w = min(d*n+1,k+1)
dp = [[0] * w for i in range(n+1) ]
dp[0][0] = 1
s = [0] * w

for i in range(n):
    # for j in range(d*n,0,-1):
    # s = [0] * w
    s[0] = dp[i][0]
    # print(s)
    for j in range(w-1):
        s[j+1] = (s[j] + dp[i][j+1]) % mod
    
    for j in range(w-1):
        dp[i+1][j+1] = s[j] % mod
        if 0 <= j-d:
            dp[i+1][j+1] = (dp[i+1][j+1] - s[j-d]) % mod

# print(dp)
print(dp[n][k] % mod)