K-Trees

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 kedges), then their weights will equal 1, 2, 3, ..., k.

The picture below shows a part of a 3-tree.

 

 

As soon as Dima, a good friend of Lesha, found out about the tree, he immediately wondered: "How many paths of total weight n (the sum of all weights of the edges in the path) are there, starting from the root of a k-tree and also containing at least one edge of weight at least d?".

Help Dima find an answer to his question. As the number of ways can be rather large, print it modulo 1000000007 (109 + 7).

Input

A single line contains three space-separated integers: n, k and d (1 ≤ n, k ≤ 100; 1 ≤ d ≤ k).

Output

Print a single integer — the answer to the problem modulo 1000000007 (109 + 7).

Examples

Input

3 3 2

Output

3

Input

3 3 3

Output

1

Input

4 3 2

Output

6

Input

4 5 2

Output

7

---

题意：有一颗k叉数（假设这棵树非常非常大），对于每个点，他到他k个孩子的边的权值分别问1~k，那么，我们需要求得是：存在多少种方案，使得这条路径上边权的总和为n，且这条路径上必须有一条边的权大于等于b，求这样的方案的个数。

解析：我们用dp[i][0]来表示总和为i且没有用过大于等于b的边的情况下的方案数目，用dp[i][1]来表示，总和为i的情况下用过大于等于b的边的情况下的方案数目。那么我们不难得出递推式：

 

得到了这几个关系式，这个题就迎刃而解了。

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
using namespace std;
int dp[200][3];
const int INF=1e9+7;
int n,k,b;
int main(){
	cin>>n>>k>>b;
	dp[0][0]=1;
	
	for(int i=1;i<=n;i++){
		for(int l=1;l<=min(k,i);l++){
			if(l<b){
				dp[i][1]+=dp[i-l][1];
				dp[i][0]+=dp[i-l][0];
				dp[i][1]%=INF;
				dp[i][0]%=INF;
			}
			else {
				dp[i][1]+=(dp[i-l][1]+dp[i-l][0])%INF;
				dp[i][1]%=INF;
			}
		}
	}
	cout<<dp[n][1]<<endl;
	return 0;
}