{"trustable":false,"prependHtml":"\u003cstyle type\u003d\u0027text/css\u0027\u003e\n .input, .output {\n border: 1px solid #888888;\n }\n .output {\n margin-bottom: 1em;\n position: relative;\n top: -1px;\n }\n .output pre, .input pre {\n background-color: #EFEFEF;\n line-height: 1.25em;\n margin: 0;\n padding: 0.25em;\n }\n \u003c/style\u003e\n \u003clink rel\u003d\"stylesheet\" href\u003d\"//codeforces.org/s/96598/css/problem-statement.css\" type\u003d\"text/css\" /\u003e\u003cscript\u003e window.katexOptions \u003d { disable: true }; \u003c/script\u003e\n\u003cscript type\u003d\"text/x-mathjax-config\"\u003e\n MathJax.Hub.Config({\n tex2jax: {\n inlineMath: [[\u0027$$$\u0027,\u0027$$$\u0027], [\u0027$\u0027,\u0027$\u0027]],\n displayMath: [[\u0027$$$$$$\u0027,\u0027$$$$$$\u0027], [\u0027$$\u0027,\u0027$$\u0027]]\n }\n });\n\u003c/script\u003e\n\u003cscript type\u003d\"text/javascript\" async src\u003d\"https://mathjax.codeforces.org/MathJax.js?config\u003dTeX-AMS_HTML-full\"\u003e\u003c/script\u003e","sections":[{"title":"","value":{"format":"HTML","content":"In a virtual reality game called \"Tree Quest,\" players navigate through an infinite rooted tree structure, each vertex representing a different level in the game. The game\u0027s mechanics dictate that: \u003cbr\u003e\n\n- Each vertex has exactly k possible paths leading to the next level. \u003cbr\u003e\n- Paths are assigned weights corresponding to their position in the sequence (1, 2, 3, ..., k). \u003cbr\u003e\n\nNow, the game developers are faced with a challenge: how many unique routes can a player take, starting from the root, and reaching a total weight of n, while ensuring that the player traverses at least one path with a weight of at least d? \u003cbr\u003e\n\nYour task is to assist the developers by providing a solution to this problem. As the number of possible routes can be substantial, output the result modulo 1000000007 (10^9 + 7).\n"}},{"title":"Input","value":{"format":"HTML","content":"A single line contains three space-separated integers: n, k, and d (1 ≤ n, k ≤ 100; 1 ≤ d ≤ k)."}},{"title":"Output","value":{"format":"HTML","content":"Print a single integer - the number of valid routes, considering the specified constraints, modulo 1000000007 (10^9 + 7)."}},{"title":"Example","value":{"format":"HTML","content":"3 3 2"}},{"title":"Ans","value":{"format":"HTML","content":"3"}}]}