#include <bits/stdc++.h>
using namespace std;
inline int gi() {
  int data = 0, fu = 1;
  char ch = 0;
  while (ch != '-' && (ch < '0' || ch > '9')) ch = getchar();
  if (ch == '-') fu = -1, ch = getchar();
  while ('0' <= ch && ch <= '9')
    data = (data << 1) + (data << 3) + (ch ^ 48), ch = getchar();
  return data * fu;
}
int f[15][15][105], n, m, nL, K, Ans, len[15], inv[15], coef[15][105];
inline void add(int &x, int y) {
  x += y;
  if (x >= 1000000007) x -= 1000000007;
}
void Dfs(int nw, int res, int l) {
  add(coef[nw][len[nw]], res);
  if (nw == K) return;
  for (int d = 1; d <= m; ++d) {
    len[nw + 1] = len[nw] + d;
    while (len[l] + m < len[nw + 1]) ++l;
    Dfs(nw + 1, 1ll * res * (nw - l + 2) % 1000000007, l);
  }
  return;
}
inline int Comb(int N, int M) {
  if (M > N || N < 0 || M < 0) return 0;
  int ret = 1;
  for (int l = N - M + 1; l <= N; ++l) ret = 1ll * l * ret % 1000000007;
  for (int l = 1; l <= M; ++l) ret = 1ll * ret * inv[l] % 1000000007;
  return ret;
}
int main() {
  n = gi();
  K = gi();
  m = gi();
  len[1] = 1;
  Dfs(1, 1, 1);
  f[0][0][0] = 1;
  nL = m * (K - 1) + m * K;
  for (int i = 0; i <= K; ++i)
    for (int j = 0; j <= K; ++j)
      for (int l = 0; l <= nL; ++l)
        if (f[i][j][l])
          for (int s = K - j; s >= 1; --s)
            for (int d = nL - l - m * (i > 0); d >= 1; --d)
              add(f[i + 1][j + s][l + d + m * (i > 0)],
                  1ll * coef[s][d] * f[i][j][l] % 1000000007);
  Ans = 0;
  inv[0] = inv[1] = 1;
  for (int i = 2; i <= K; ++i)
    inv[i] =
        1ll * (1000000007 - 1000000007 / i) * inv[1000000007 % i] % 1000000007;
  for (int i = 1; i <= K; ++i)
    for (int l = 0; l <= nL; ++l)
      if (f[i][K][l])
        add(Ans, 1ll * f[i][K][l] * Comb(n - l + i, i) % 1000000007);
  cout << Ans << endl;
  return 0;
}
