#include<bits/stdc++.h>
#define int long long
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
using namespace std;
template<typename T>istream&operator>>(istream&I,vector<T>&v){for(auto&i:v)I>>i;return I;}
template<typename T>ostream&operator<<(ostream&O,vector<T>&v){for(auto&i:v)O<<i<<' ';return O;}
namespace AC{
const int mod=1e9+7;
void solve(){
	int n,k,d;
	cin>>n>>k>>d;
	int a=n%(k-1)==0?k-1:n%(k-1),b=(n-a)/(k-1);
	if(d==1){
		cout<<a<<endl;
		return;
	}
	vector<vector<int>> dp(a+1,vector<int>(b+1)),DP(dp);
	dp[0][0]=1;
	for(int i=1;i<=a;i++){
		int x=0,y=0,z=0;
		for(int j=0;j<=b;j++){
			x=(x+dp[i-1][j])%mod;
			y=(y+DP[i-1][j])%mod;
			z=(z*d+dp[i-1][j])%mod;
			dp[i][j]=x;
			DP[i][j]=(y+z)%mod;
		}
	}
	cout<<DP[a][b]<<endl;
}
}
signed main(){
	int t=1;
	//cin>>t;
	while(t--)AC::solve();
}