#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0;i < n;i++)
#define ll long long
using namespace std;
//typedef vector<unsigned int>vec;
//typedef vector<ll>vec;
//typedef vector<vec> mat;
typedef pair<int, int> P;
typedef pair<ll,ll> LP;
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
const int INF = 1000000000;
const ll LINF = 1000000000000000000;//1e18
const ll  MOD = 1000000007;
const double PI = acos(-1.0);
const double EPS = 1e-10;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
//template<class T> inline void add(T &a, T b){a = ((a+b) % MOD + MOD) % MOD;};

int dp[333][909090];

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    int N, d, K;
    cin >> N >> d >> K;
    memset(dp, -1, sizeof(dp));
    dp[0][0] = 1;
    auto dfs = [&](auto && self, int n, int dist) -> ll{
        if(n == 0){
            //cout << dist << endl;
            if(dist == 0) return 1;
            else return 0;
        }
        if(dp[n][dist] != -1) return dp[n][dist];
        ll res = 0;
        for(int i=1;i<=d;i++){
            if(dist < 0) break;
            res += self(self, n-1, dist - i);
            res %= MOD;
        }
        return dp[n][dist] = res % MOD;
    };

    cout << dfs(dfs, N, K) << endl;
}