#include <bits/stdc++.h>
using namespace std;
const int maxN = 1e5 + 10, mod = 1e9 + 7, maxHav = 13, maxST = (1 << 5) + 1;
int dotN, jumpK, disM, colC;
void add(int &fir, long long sec) { fir = (long long)(fir + sec) % mod; }
struct Matrix {
  int num[210][210], row, col;
  void init(int sze) {
    row = col = sze;
    memset(num, 0, sizeof(num));
    for (int rowI = 0; rowI < row; ++rowI) {
      num[rowI][rowI] = 1;
    }
  }
  void init2(int r, int c) {
    row = r, col = c;
    memset(num, 0, sizeof(num));
  }
  Matrix operator=(const Matrix d) {
    row = d.row;
    col = d.col;
    for (int rowI = 0; rowI < row; ++rowI) {
      for (int colJ = 0; colJ < col; ++colJ) {
        num[rowI][colJ] = d.num[rowI][colJ];
      }
    }
    return (*this);
  }
  Matrix operator*(const Matrix d) const {
    Matrix ret;
    memset(ret.num, 0, sizeof(ret.num));
    ret.row = row;
    ret.col = d.col;
    for (int rowI = 0; rowI < ret.row; ++rowI) {
      for (int colJ = 0; colJ < ret.col; ++colJ) {
        for (int mid = 0; mid < col; ++mid) {
          add(ret.num[rowI][colJ], 1ll * num[rowI][mid] * d.num[mid][colJ]);
        }
      }
    }
    return ret;
  }
  Matrix power(int up) const {
    Matrix ret, base = (*this);
    ret.init(row);
    while (up) {
      if (up & 1) ret = ret * base;
      base = base * base;
      up >>= 1;
    }
    return ret;
  }
} ans, base, orig;
int pos(int er, int san) { return er * colC + san; }
int bitCount(int st) {
  int ret = 0;
  for (int weiI = 0; weiI < 4; ++weiI) {
    if (st & (1 << weiI)) {
      ++ret;
    }
  }
  return ret;
}
void init() {
  scanf("%d%d%d", &dotN, &jumpK, &disM);
  colC = 1 << disM;
  ans.init(colC * (jumpK + 1));
  orig.init2(1, colC * (jumpK + 1));
  orig.num[0][0] = 1;
  base.init2(colC * (jumpK + 1), colC * (jumpK + 1));
  for (int jumpJ = 0; jumpJ <= jumpK; ++jumpJ) {
    for (int stK = 0; stK < (1 << disM); ++stK) {
      if (!(stK & (1 << disM - 1))) {
        add(base.num[pos(jumpJ, stK << 1)][pos(jumpJ, stK)], 1);
        add(base.num[pos(jumpJ, stK << 1 | 1)][pos(jumpJ, stK)], 1);
      } else {
        if (jumpJ >= 1) {
          add(base.num[pos(jumpJ - 1, (stK - (1 << disM - 1)) << 1)]
                      [pos(jumpJ, stK)],
              1ll * (1 + bitCount((stK - (1 << disM - 1)) << 1)));
          add(base.num[pos(jumpJ - 1, (stK - (1 << disM - 1)) << 1 | 1)]
                      [pos(jumpJ, stK)],
              1ll * (1 + bitCount((stK - (1 << disM - 1)) << 1 | 1)));
        }
      }
    }
  }
}
int main() {
  init();
  int cnt = 0;
  ans = orig * base.power(dotN);
  for (int stK = 0; stK < (1 << disM); ++stK)
    add(cnt, ans.num[0][pos(jumpK, stK)]);
  printf("%d\n", cnt);
  return 0;
}
