#include <bits/stdc++.h>

using namespace std;
using ll = long long;
using VI = vector<int>;
using VL = vector<ll>;
using PII = std::pair<int, int>;
using PLL = std::pair<ll, ll>;

#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define allpt(v) (v).begin(), (v).end()
#define allpt_c(v) (v).cbegin(), (v).cend()
#define allpt_r(v) (v).rbegin(), (v).rend()

const int mod = 1e9 + 7;
const string wsp = " ";
const string tb = "\t";
const string rt = "\n";

template <typename T>
void show1dvec(const vector<T> &v)
{
    if (v.size() == 0)
        return;
    int n = v.size() - 1;
    rep(i, n) cout << v[i] << wsp;
    cout << v[n] << rt;
    return;
}

template <typename T>
void show2dvec(const vector<vector<T>> &v)
{
    int n = v.size();
    rep(i, n) show1dvec(v[i]);
}

template <typename T, typename S>
void show1dpair(const vector<pair<T, S>> &v)
{
    int n = v.size();
    rep(i, n) cout << v[i].first << wsp << v[i].second << rt;
    return;
}

template <typename T, typename S>
void pairzip(const vector<pair<T, S>> &v, vector<T> &t, vector<T> &s)
{
    int n = v.size();
    rep(i, n)
    {
        t.push_back(v[i].first);
        s.push_back(v[i].second);
    }
    return;
}

template <typename T>
void maxvec(vector<T> &v)
{
    T s = v[0];
    int n = v.size();
    rep(i, n - 1)
    {
        if (s > v[i + 1])
        {
            v[i + 1] = s;
        }
        s = v[i + 1];
    }
}

template <typename T, typename S>
bool myfind(T t, S s)
{
    return find(t.cbegin(), t.cend(), s) != t.cend();
}

VL cumsum(VL &v)
{
    ll s = 0;
    VL ret(v.size());
    rep(i, v.size())
    {
        s += v[i];
        if (s >= mod) s -= mod;
        ret[i] = s;
    }
    return ret;
}

int main()
{

#ifdef DEBUG
    cout << "DEBUG MODE" << endl;
    ifstream in("input.txt"); //for debug
    cin.rdbuf(in.rdbuf());    //for debug
#endif

    int n, d, k, s;
    cin >> n >> d >> k;
    vector<VL> dp(n + 1, VL(k + 1, 0));
    VL cum_dp;
    dp[0][0] = 1;

    rep(i, n)
    {
        cum_dp = cumsum(dp[i]);
        rep2(j, 1, k + 1)
        {
            s = max(j - d - 1, -1);
            if (s == -1)
            {
                dp[i + 1][j] += cum_dp[j - 1];
                if (dp[i + 1][j] >= mod) dp[i + 1][j] -= mod;
            }
            else
            {
                dp[i + 1][j] += cum_dp[j - 1] - cum_dp[j - d - 1];
                if (dp[i + 1][j] < 0) dp[i + 1][j] += mod;
                else if (dp[i + 1][j] >= mod) dp[i + 1][j] -= mod;
            }
        }
    }

    cout << dp[n][k] << rt;

    return 0;
}