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*).
n,k,d = list(map(int, input().split(" ")))

arr = [[0 for _ in range(n+1)]  for __ in range(k+1)]

for y in range(1,k+1):
	for x in range(y,n+1):
		
		if(x==y or y==1):
			arr[y][x]=1
		else:
			for r in range(1,d):
				if(arr[y][x-r]!=0):
					arr[y][x]+=arr[y][x-r]	
				else:
					break
			for r in range(d,n+1):
				for q in range(1,d+1):
					if(x>=r):
						if(arr[q][x-r]!=0):	
							arr[y][x]+=arr[q][x-r]
						else:
							break
			if(x>=y and x<=k):
				arr[y][x]+=1

print(arr[d][n])