#include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
using ll = long long;
#define rep(i, j, n) for (ll i = j; i < (n); ++i)
#define rrep(i, j, n) for (ll i = (n)-1; j <= i; --i)
#define all(a) a.begin(), a.end()
template <typename T>
std::ostream &operator<<(std::ostream &os, std::vector<T> &a) {
  for (size_t i = 0; i < a.size(); ++i) os << (i > 0 ? " " : "") << a[i];
  return os << '\n';
}
template <typename T>
std::istream &operator>>(std::istream &is, std::vector<T> &a) {
  for (T &x : a) { is >> x; }
  return is;
}

// [[maybe_unused]] static constexpr long long MOD = 998244353;
[[maybe_unused]] static constexpr long long MOD = 1e9 + 7;
[[maybe_unused]] static constexpr int INF = 0x3f3f3f3f;
[[maybe_unused]] static constexpr long long INFL = 0x3f3f3f3f3f3f3f3fLL;

int main() {
  cin.tie(0)->sync_with_stdio(0);
  int n, d, k;
  cin >> n >> d >> k;
  vector<vector<ll>> dp(n + 1, vector<ll>(k + 1));
  dp[0][0] = 1;
  rep(i, 0, n) {
    rep(j, 1, k + 1) dp[i][j] += dp[i][j - 1];
    rep(j, 1, k + 1)(dp[i + 1][j] +=
                     dp[i][j - 1] - (j - d - 1 >= 0 ? dp[i][j - d - 1] : 0)) %=
      MOD;
  }
  cout << dp[n][k];
}