#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<bitset>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<deque>
#include<list>
#include<iomanip>
#include<cmath>
#include<cstring>
#include<functional>
using namespace std;

#define repr(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) repr(i, 0, n)
#define INF 2e9
#define MOD 1000000007
//#define MOD 998244353
#define LINF (long long)4e18
#define jck 3.141592

using ll = long long;
using Pi = pair<int,int>;
using Pl = pair<ll,ll>;



ll dp[310][90010];

int main(){
    int n,d,k; cin >> n >> d >> k;
    dp[0][0] = 1;
    dp[0][1] = -1;
    rep(i,n+1)rep(j,d*n+1){
        if(j >= 1){
            dp[i][j] += dp[i][j-1];
            dp[i][j] %= MOD;
        }
        dp[i+1][j+1] += dp[i][j];
        dp[i+1][j+1] %= MOD;
        dp[i+1][j+d+1] -= dp[i][j];
        if(dp[i+1][j+d+1] < 0) dp[i+1][j+d+1] %= MOD;
    }
    cout << dp[n][k] << endl;

}