// I SELL YOU...! 
#include<iostream>
#include<vector>
#include<algorithm>
#include<functional>
#include<queue>
#include<chrono>
#include<iomanip>
#include<map>
#include<set>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
#define MOD 1000000007
#define MAX 10000
void init_io(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << setprecision(10);
}
signed main(){
  init_io();
  ll n,d,k;
  vector<ll> dp(MAX,0);
  cin >> n >> d >> k;
  dp[0] = 1;
  for(int i=0;i<n;i++){
    for(int j=1;j<MAX;j++){
      dp[j] += dp[j-1];
      dp[j] %= MOD;
    }
  }
  for(int i=0;i<n;i++){
    vector<ll> cdp(dp.begin(),dp.end());
    for(int i=d;i<MAX;i++){
      cdp[i] = (cdp[i]-dp[i-d]+MOD)%MOD;
    }
    dp = cdp;
  }
  cout << dp[k-n]<<endl;
}