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*).
a = list(map(int,input().strip().split()))
n,k,d=a
b=[0 for _ in range(n+1)]
c=[0 for _ in range(n+1)]
b[-1]=1
c[-1],c[-2]=1,1
sc=2
if d!=1:
    b[-2]=1
    s=sum(b[n-2:])
else:
    b[-2]=0
    s=0

for i in range(n-2,-1,-1):
    if i+k+1<=n:
        # s-=b[i+k+1]
        sc-=c[i+k+1]
    if i+d<=n:
        s-=b[i+d]
        
    c[i]=sc
    sc+=c[i]
    b[i]=s
    s+=b[i]
print(c[0]-b[0])
print(b,c)

