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*).
inpu = input()
iinList = inpu.split(' ')
n = int(iinList[0])
k = int(iinList[1])
d = int(iinList[2])
mn = min(k,n)
s=0
                 
for i in range(d,mn + 1):
    l = [1 for _ in range(n - i)]
    l.insert(0,i)
    x = 1
    
    while True:
        if sum(l) >n or sum(l) < n:
            break
        
        if len(l) == 1 :
            s += 1
            break
        
        if l[x] < l[0]:
            s += len(l)
            l[x] = l[x] + 1
            l.pop()
            
            
        else:
            x += 1
        if l == [i for z in range(len(l))] and len(l) > 1 :
            s += 1
            break
        
print(s)