Quite recently a creative student Lesha had a lecture on trees. After the lecture Lesha was inspired and came up with the tree of his own which he called a *k*-tree.

A *k*-tree is an infinite rooted tree where:
 -  each vertex has exactly *k* children; -  each edge has some weight; -  if we look at the edges that goes from some vertex to its children (exactly *k* edges), then their weights will equal 1, 2, 3, ..., *k*. 
The picture below shows a part of a 3-tree.

 

 <img class="tex-graphics" src="https://espresso.codeforces.com/61ac5ac17c4d2f220968eff8fb59bb3c8dc77edf.png" style="max-width: 100.0%;max-height: 100.0%;"/>

 

Help Dima find an answer to his question. As the number of ways can be rather large, print it modulo 1000000007 (10<sup class="upper-index">9</sup> + 7).
A single line contains three space-separated integers: *n*, *k* and *d* (1 ≤ *n*, *k* ≤ 100; 1 ≤ *d* ≤ *k*).
import sys
sys.stdin = open('input.txt', 'r')

from array import array


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

dp=[]

for r in range(n+1):
	dp.append(array("Q",[0])*(k+1))


dp[0][0]=1


for t in range(1,k+1):
	if(t<=n):
		dp[t][t]+=dp[0][0]




for r in range(1,n+1):
	for q in range(1,k+1):
		for z in range(1,k+1):

			if r+z<=n:
				if(z>q):
					dp[r+z][z]+=dp[r][q]
				else:
					dp[r+z][q]+=dp[r][q]

answer = 0
for t in range(k-d+1):
	answer+=dp[n][d+t]
answer=answer%(1000000007)

print(answer)




