#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
//-------------------------------------------------------

int N,D,K;
ll dp[303030];
ll mo=1000000007;

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N>>D>>K;
	dp[0]=1;
	while(N--) {
		for(i=1;i<=K;i++) (dp[i]+=dp[i-1])%=mo;
		for(i=K;i>=0;i--) {
			if(i==0) dp[i]=0;
			else {
				dp[i]=dp[i-1];
				if(i-(D+1)>=0) dp[i]-=dp[i-(D+1)];
				dp[i]=(dp[i]%mo+mo)%mo;
			}
		}
	}
	cout<<dp[K]<<endl;
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}