#include<bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(),x.end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define INF 1000000000
#define mod 1000000007
using ll=long long;
const ll LINF=1001002003004005006ll;
int dx[]={1,0,-1,0};
int dy[]={0,1,0,-1};
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;}

signed main(){
    cin.tie(0);
    ios::sync_with_stdio(0);

    int n,d,k;cin>>n>>d>>k;

    ll dp[k+1]={};
    dp[0]=1;
    rep(_,n){
        ll sum[k+2];
        rep(i,k+1) sum[i+1]=(sum[i]+dp[i])%mod;
        rep(i,k+1){
            dp[i]=(sum[i]-sum[max(0,i-d)])%mod;
            if(dp[i]<0) dp[i]+=mod;
        }
        // rep(i,k+1)cout<<dp[i]<<" ";cout<<endl;
    }
    cout<<dp[k]<<endl;
    return 0;
}