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 collections import *
import sys
from functools import reduce
from itertools import *
from heapq import *
from sys import setrecursionlimit
from threading import stack_size
import threading

dirs4 = [[1, 0], [-1, 0], [0, 1], [0, -1]]
dirs8 = [[1, 0], [-1, 0], [0, 1], [0, -1], [1, 1], [-1, -1], [1, -1], [-1,1]]
def _input(): return sys.stdin.readline().rstrip("\r\n") 
def I(): return int(_input())
def II(): return _input()
def III(): return map(int, _input().split())
def IV(): return list(map(int, _input().split()))
def V(): return sorted(list(map(int, _input().split())))
def out(var): sys.stdout.write(str(var) + "\n")

def Solve():
    N, K, D = III()
    memory = {}

    def helper(amount, added, curr):
        change = added
        if amount == 0 and added:
            return 1
        if (amount - curr) in memory:
            return memory[(amount, curr)]
        count = 0
        for i in range(1, K + 1):
            if amount - i >= 0:
                change = change or i >= D
                count += helper(amount - i, change, i)
        memory[(amount, curr)] = count
        return count
    print(helper(N, 0, 0) % 1000000007)
                
T = 1
for ___ in range(T):
  Solve()
  

"""
setrecursionlimit(1<<30)
stack_size(1<<27)

main_thread = threading.Thread(target=Solve)
main_thread.start()
main_thread.join()

rep = {i: i for i in range(N)}
size = {i: 1 for i in range(N)}
         
def find(node):
  if rep[node] == node:
    return rep[node]
  rep[node] = find(rep[node])
  return rep[node]

  def union(x, y):
    xrep = find(x)
    yrep = find(y)
    if xrep != yrep:
      if size[xrep] > size[yrep]:
        xrep, yrep = yrep, xrep
        size[yrep] += size[xrep]
        rep[xrep] = yrep    
"""
