C. k-Tree Codeforces Round 247 (Div. 2)

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

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.

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

Copy

3 3 2

output

Copy

3

input

Copy

3 3 3

output

Copy

1

input

Copy

4 3 2

output

Copy

6

input

Copy

4 5 2

output

Copy

7

 题目大致意思：有一个完全n叉树，如图可知所有的树枝值为1~k，求到k点有几种方法，结果对1e9+7取模。

要求：路径至少要有一条数值大于等于d。

由要求可得知所有由小于d的路径拼接的路是不合法的。

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define endl "\n"

const ll N = 1e2+7 ,M = 1e9+7;
ll n,d,k;
ll dp[2][N];//0维度dp所有的路径,1维度dp所有不可能的路径

void solve(){
	cin >> n >> k >> d;
	dp[0][0]=dp[1][0]=1;//初始点为1
	for(ll i = 1 ; i <= n ; i ++){
		for(ll j = 1 ; j <= k ; j ++)//取所有的路径 
			if(i-j > -1)dp[0][i] = (dp[0][i] + dp[0][i-j])%M;
			else break;
		for(ll j = 1 ; j < d ; j ++)//取不可能的路径 
			if(i-j > -1)dp[1][i] = (dp[1][i] + dp[1][i-j])%M;
			else break;
	}
	cout << (dp[0][n]-dp[1][n]+M)%M << endl;
	return;
}