#include <bits/stdc++.h>
#define rep(i,n) for(int i=(0);i<(n);i++)

using namespace std;

typedef long long ll;

const ll MOD = 1e9 + 7;

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

	ll n, d, k;
	cin >> n >> d >> k;

	ll max_n = n * (d - 1) + 1;
	
	ll dp[2][max_n];
	rep(i, 2) rep(j, max_n) dp[i][j] = 0;

	dp[0][0] = 1;
	rep(i, n){
		ll t = 0;
		rep(j, (i+1) * (d - 1) + 1){
			t += dp[i%2][j];
			t %= MOD;
			if(j >= d) {
				t += MOD - dp[i%2][j-d];
				t %= MOD;
			}
			dp[(i+1) % 2][j] = t;
		}
	}

	int idx = (k-1) - (n-1);
	if(idx < 0 || idx >= max_n){
		cout << 0 << endl;
	}else{
		cout << dp[n % 2][idx] << endl;
	}		
}