#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <set>
#include <map>
#define N_MAX 200000

using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;

const ll MOD = 1000000007;

ll inv[N_MAX],fac[N_MAX],finv[N_MAX];

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

ll inv_(ll n){
    if(n == 1) return 1;
    else return MOD-inv_(MOD%n)*(MOD/n)%MOD;
}

ll comb(ll n, ll r){
    if(n < 0) return 0;
  ll ans;
  if(n < r){
      ans = 0;
  }else{
      ans = (fac[n]*finv[r])%MOD;
      ans = (ans*finv[n-r])%MOD;
      ans = (ans+MOD)%MOD;
  }
  return ans;
}

int N, K, D;

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    init();
    cin >> N >> D >> K;
    ll ans = 0;
    int R = K-N;
    for(int i = 0; i <= N; i++){
        // cout << i << endl;
        ll c = comb(N, i);
        if(R-D*i < 0) break;
        ll h = comb(R-D*i+N-1, N-1);
        if(i%2 == 0) ans += (c*h)%MOD;
        else ans -= (c*h)%MOD;
        ans %= MOD;
        // cout << c << ' ' << h << endl;
        // cout << ans << endl;
    }
    ans += MOD;
    ans %= MOD;
    cout << ans << endl;
}