#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int,int> P;
ll const mod = 1e9+7;

#define p_ary(ary,a,b) do { cout << "["; for (int count = (a);count < (b);++count) cout << ary[count] << ((b)-1 == count ? "" : ", "); cout << "]\n"; } while(0)
#define p_map(map,it) do {cout << "{";for (auto (it) = map.begin();;++(it)) {if ((it) == map.end()) {cout << "}\n";break;}else cout << "" << (it)->first << "=>" << (it)->second << ", ";}}while(0)

template<typename T1,typename T2>ostream& operator<<(ostream& os,const pair<T1,T2>& a) {os << "(" << a.first << ", " << a.second << ")";return os;}

const char newl = '\n';

int main() {
    int n,d,k;
    cin >> n >> d >> k;
    vector<vector<ll>> dp(n+1,vector<ll>(k+1,0));
    dp[0][0] = 1;
    for (int i = 0;i < n;++i) {
        ll sum = dp[i][0];
        for (int j = 1;j < k+1;++j) {
            dp[i+1][j] = sum;
            (sum += dp[i][j]) %= mod;
            if (j >= d) (sum -= dp[i][j-d]) %= mod;
        }
    }
    cout << (dp[n][k]+mod)%mod << endl;
}