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*).
from sys import stdin


mod = 10**9 + 7


def solve():
    n, k, d = map(int, stdin.readline().split())

    if d > n:
        print(0)
        return

    dp = [[0, 0] for _ in range(n + 1)]
    dp[n][1] = 1

    for sm in range(n - 1, -1, -1):
        for edge_found in 0, 1:
            for i in range(1, min(k, n - sm) + 1):
                dp[sm][edge_found] = (dp[sm][edge_found] + dp[sm + i][int(edge_found or i >= d)]) % mod

    print(dp[0][0])


solve()
