#define rep(i, n) for(int i=0;i<(int)(n);i++)
#define ALL(v) v.begin(), v.end()
typedef long long ll;

#include <bits/stdc++.h>
using namespace std;

const int MAX=210000;
const int MOD=1e9+7;
ll fac[MAX],finv[MAX],inv[MAX];

void init(){
  fac[0]=fac[1]=1;
  finv[0]=finv[1]=1;
  inv[1]=1;
  for(int i=2;i<MAX;i++){
    fac[i]=fac[i-1]*i%MOD;
    inv[i]=MOD-inv[MOD%i]*(MOD/i)%MOD;
    finv[i]=finv[i-1]*inv[i]%MOD;
  }
}

ll nCr(int n,int k){
  if(n<k) return 0;
  if(n<0 || k<0) return 0;
  return fac[n]*(finv[k]*finv[n-k]%MOD)%MOD;
}

int main() {
  ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  
  init();
  ll n,d,k;
  cin>>n>>d>>k;
  ll ans=0;
  rep(i,n+1){
    if(i%2==0) ans=(ans+nCr(n,i)*nCr(k-i*d-1,n-1)%MOD)%MOD;
    else ans=(ans-nCr(n,i)*nCr(k-i*d-1,n-1)%MOD+MOD)%MOD;
  }
  cout<<ans<<endl;
  
  return 0;
}