#include <bits/stdc++.h>
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
#pragma GCC target( \
    "sse,sse2,sse3,ssse3,sse4.1,sse4.2,avx,avx2,popcnt,tune=native")
using namespace std;
const int MN = 210, MK = 13, MM = (1 << 4), inf = 1000000005, mod = 1000000007;
const long long INF = 1000000000000000005LL;
struct matrix {
  long long V[MN][MN];
  matrix(long long prz = 1LL) {
    for (int i = 0; i < MN; ++i)
      for (int j = 0; j < MN; ++j) V[i][j] = 0LL;
    for (int i = 0; i < MN; ++i) V[i][i] = prz;
  }
  matrix operator*(matrix& m) {
    matrix wyn(0LL);
    for (int i = 0; i < MN; ++i)
      for (int j = 0; j < MN; ++j)
        for (int k = 0; k < MN; ++k) {
          wyn.V[i][j] += V[i][k] * m.V[k][j];
          if (wyn.V[i][j] >= mod) wyn.V[i][j] %= mod;
        }
    return wyn;
  }
  matrix operator^(long long wyk) {
    matrix wyn(1LL), tmp = (*this);
    while (wyk) {
      if (wyk & 1LL) wyn = wyn * tmp;
      tmp = tmp * tmp;
      wyk >>= 1;
    }
    return wyn;
  }
};
int main() {
  int n, k, m;
  scanf("%d%d%d", &n, &k, &m);
  matrix A(0LL);
  matrix B(0LL);
  A.V[0][0] = 1LL;
  int M = (1 << m), K = k + 1;
  for (int j = 0; j <= k; ++j)
    for (int mask = 0; mask < M; ++mask) {
      int a = mask * K + j;
      int m1, m2;
      m1 = (mask >> 1);
      m2 = m1 + (1 << (m - 1));
      if (mask & 1) {
        if (j > 0) {
          int b = m1 * K + j - 1;
          B.V[b][a] += (1 + __builtin_popcount(m1));
          b = m2 * K + j - 1;
          B.V[b][a] += (1 + __builtin_popcount(m2));
        }
      } else {
        int b = m1 * K + j;
        B.V[b][a]++;
        b = m2 * K + j;
        B.V[b][a]++;
      }
    }
  B = B ^ n;
  A = A * B;
  long long suma = 0LL;
  for (int i = 0; i < M; ++i) suma += A.V[0][i * K + k];
  printf("%lld", suma % mod);
}
