#include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
inline int add(int a, int b) {
  if ((a += b) >= mod) a -= mod;
  return a;
}
inline int mult(int a, int b) {
  long long t = 1ll * a * b;
  if (t >= mod) t %= mod;
  return t;
}
namespace matrix {
template <int N, int M>
class matr {
 public:
  int dat[N][M];
  void init() { memset(dat, 0, sizeof(dat)); }
  void iden() {
    init();
    for (int i = 0; i < min(N, M); i++) dat[i][i] = 1;
  }
  matr<M, N> trans() {
    matr<M, N> out;
    for (int i = 0; i < M; i++)
      for (int j = 0; j < N; j++) out[i][j] = dat[j][i];
  }
  const int *operator[](const int &x) const { return dat[x]; }
  int *operator[](const int &x) { return dat[x]; }
  matr<N, M> operator+(const matr<N, M> a) {
    matr<N, M> out;
    for (int i = 0; i < N; i++)
      for (int j = 0; j < M; j++) out[i][j] = add(dat[i][j], a[i][j]);
    return out;
  }
  matr<N, M> operator*(const int &x) {
    matr<N, M> out = *this;
    for (int i = 0; i < N; i++)
      for (int j = 0; j < M; j++) out[i][j] = mult(out[i][j], x);
    return out;
  }
  template <int X>
  friend matr<N, M> operator*(const matr<N, X> a, const matr<X, M> b) {
    matr<N, M> out;
    out.init();
    for (int i = 0; i < N; i++) {
      for (int j = 0; j < X; j++) {
        if (a[i][j]) {
          for (int k = 0; k < M; k++)
            out[i][k] = add(out[i][k], mult(a[i][j], b[j][k]));
        }
      }
    }
    return out;
  }
};
};  // namespace matrix
using namespace matrix;
int n, K, m;
matr<13 * 16, 13 * 16> trans;
inline int getid(int i, int j) { return (i << m) | j; }
int main() {
  scanf("%d%d%d", &n, &K, &m);
  for (int i = 0; i <= K; i++) {
    for (int j = 0; j < (1 << m); j++) {
      int S1 = getid(i, j);
      int curs = (j >> 1);
      int S2 = getid(i, curs);
      trans[S1][S2] = add(trans[S1][S2], 1);
      if (i + 1 <= K) {
        curs = (j >> 1) | (1 << (m - 1));
        S2 = getid(i + 1, curs);
        trans[S1][S2] = add(trans[S1][S2], __builtin_popcount(j) + 1);
      }
    }
  }
  matr<1, 13 * 16> ans;
  ans.init();
  ans[0][getid(0, 0)] = 1;
  while (n) {
    if (n & 1) ans = ans * trans;
    trans = trans * trans;
    n >>= 1;
  }
  int ret = 0;
  for (int i = 0; i < (1 << m); i++) ret = add(ret, ans[0][getid(K, i)]);
  printf("%d\n", ret);
  return 0;
}
