#include <cstdio>
#include <climits>
#include <cmath>
#include <iostream>
#include <iomanip>
#include <string>
#include <cstdio>
#include <climits>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <utility>
#include <queue>
#include <cstring>
#include <set>
#include <map>
#include <complex>
#define rep(i, n) for (int i = 0; i < int(n); i++)
using namespace std;
long long MOD = 1000000007;
long long INF = 1000000000000000; //10^15
typedef long long ll;
typedef unsigned long long ull;


ll powMod(ll x, ll n, ll mod) {
  if (n == 0) return 1;
  ll t = powMod(x, n/2, mod);
  t = t * t % mod;
  if (n & 1) return t * x % mod;
  return t;
}

ll dp[100010][310] = {}, sum[100010][310] = {};

int main(void) {
  
  int n, d, k;
  cin >> n >> d >> k;

  
  dp[0][0] = 1;
  for (int i = 0; i <= k; i++) sum[i][0] = 1;
  for (int x = 1; x <= k; x++) {
    for (int y = 1; y <= min(n, x); y++) {
      dp[x][y] = (sum[x-1][y-1] - (x-d-1<0?0:sum[x-d-1][y-1]))%MOD;
      dp[x][y] = (dp[x][y]+MOD)%MOD;
      sum[x][y] = (sum[x-1][y]+dp[x][y])%MOD;
    }
  }
  cout << dp[k][n] << endl;

  return 0;
}