#include <bits/stdc++.h>
using namespace std;
void add(int &x, int y) {
  x += y;
  if (x >= 1000000007) x -= 1000000007;
}
inline int read() {
  int x = 0;
  bool t = false;
  char ch = getchar();
  while ((ch < '0' || ch > '9') && ch != '-') ch = getchar();
  if (ch == '-') t = true, ch = getchar();
  while (ch <= '9' && ch >= '0') x = x * 10 + ch - 48, ch = getchar();
  return t ? -x : x;
}
int b[13][1 << 4], bel[1 << 4], n, K, m, N, ans;
struct Matrix {
  int s[210][210];
  void clear() {
    for (int i = 1; i <= N; ++i)
      for (int j = 1; j <= N; ++j) s[i][j] = 0;
  }
  void init() {
    clear();
    for (int i = 1; i <= N; ++i) s[i][i] = 1;
  }
  int *operator[](int x) { return s[x]; }
} A, Tr;
Matrix operator*(Matrix &a, Matrix &b) {
  Matrix c;
  c.clear();
  for (int i = 1; i <= N; ++i)
    for (int j = 1; j <= N; ++j)
      for (int k = 1; k <= N; ++k)
        c[i][j] = (c[i][j] + 1ll * a[i][k] * b[k][j]) % 1000000007;
  return c;
}
int main() {
  n = read();
  K = read();
  m = read();
  for (int i = 1; i < 1 << m; ++i) bel[i] = bel[i >> 1] + (i & 1);
  for (int j = 0; j <= K; ++j)
    for (int S = 0; S < 1 << m; ++S) b[j][S] = ++N;
  for (int j = 0; j <= K; ++j)
    for (int S = 0; S < 1 << m; ++S) {
      int T = (S << 1) & ((1 << m) - 1);
      add(Tr[b[j][S]][b[j][T]], 1);
      if (j < K) add(Tr[b[j][S]][b[j + 1][T | 1]], bel[S] + 1);
    }
  A[1][1] = 1;
  while (n) {
    if (n & 1) A = A * Tr;
    Tr = Tr * Tr;
    n >>= 1;
  }
  for (int i = 0; i < 1 << m; ++i) add(ans, A[1][b[K][i]]);
  printf("%d\n", ans);
  return 0;
}
