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*).
# Initialize the array dp to be a 2D array of size (n+1) x (k+1)
dp = [[0] * (k+1) for _ in range(n+1)]

# Base case: There is only one way to reach the root with weight 0
dp[0][1] = 1

# Iterate through each possible weight and number of children
for w in range(1, n+1):
  for c in range(1, k+1):
    # If the current weight is at least d, add the number of ways to reach the
    # parent vertex with weight w-c to dp[w][c]
    if w >= d:
      dp[w][c] += dp[w-c][c]
    # Add the number of ways to reach the parent vertex with weight w to dp[w][c]
    dp[w][c] += dp[w][c-1]

# Print the number of ways to reach the root with weight n and at least one edge
# of weight at least d
print(dp[n][k])
