#include <bits/stdc++.h>
const int P = 1e9 + 7;
int n, k, m;
void add(int &x, int y) { (x += y) >= P && (x -= P); }
struct Matrix {
  int n, m;
  std::vector<std::vector<int>> A;
  Matrix(int n, int m) : n(n), m(m) { A.assign(n, std::vector<int>(m, 0)); }
  void identity() {
    for (int i = 0; i < n; i++) A[i][i] = 1;
  }
  friend Matrix operator*(Matrix a, Matrix b) {
    Matrix c(a.n, b.m);
    for (int i = 0; i < a.n; i++) {
      for (int j = 0; j < b.m; j++) {
        for (int k = 0; k < a.m; ++k) {
          add(c.A[i][j], 1LL * a.A[i][k] * b.A[k][j] % P);
        }
      }
    }
    return c;
  }
  friend Matrix operator^(Matrix x, int p) {
    Matrix ans(x.n, x.n);
    ans.identity();
    for (; p; p >>= 1, x = x * x) {
      if (p & 1) ans = ans * x;
    }
    return ans;
  }
};
int id(int i, int s) { return i * (1 << m) + s; }
int main() {
  scanf("%d%d%d", &n, &k, &m);
  int msk = 1 << m, tot = (k + 1) * msk;
  Matrix x(tot, tot), f(tot, 1);
  for (int i = 0; i <= k; i++) {
    for (int cur = 0; cur < msk; cur++) {
      int nxt = (cur << 1) % msk;
      x.A[id(i, nxt)][id(i, cur)] = 1;
      if (i < k) {
        int v = __builtin_popcount(cur) + 1;
        x.A[id(i + 1, nxt | 1)][id(i, cur)] = v;
      }
    }
  }
  f.A[0][0] = 1;
  f = (x ^ n) * f;
  int ans = 0;
  for (int i = 0; i < msk; i++) add(ans, f.A[id(k, i)][0]);
  printf("%d\n", ans);
  return 0;
}
