#include <bits/stdc++.h>
void mult(int aa[][((1 << 4) * (12 + 1) * 2)],
          int bb[][((1 << 4) * (12 + 1) * 2)],
          int cc[][((1 << 4) * (12 + 1) * 2)], int n) {
  int i, j, k;
  for (i = 0; i < n; i++) memset(cc[i], 0, n * sizeof *cc[i]);
  for (i = 0; i < n; i++)
    for (k = 0; k < n; k++) {
      int *bk = bb[k], a = aa[i][k];
      if (a)
        for (j = 0; j < n; j++) {
          int b = bk[j];
          if (b) cc[i][j] = (cc[i][j] + (long long)a * b) % 1000000007;
        }
    }
}
void power(int aa[][((1 << 4) * (12 + 1) * 2)],
           int pp[][((1 << 4) * (12 + 1) * 2)],
           int tt[][((1 << 4) * (12 + 1) * 2)], int n, int k) {
  if (k == 0) {
    int i, j;
    for (i = 0; i < n; i++)
      for (j = 0; j < n; j++) pp[i][j] = i == j;
    return;
  }
  if (k % 2 == 0) {
    power(aa, tt, pp, n, k / 2);
    mult(tt, tt, pp, n);
  } else {
    power(aa, pp, tt, n, k / 2);
    mult(pp, pp, tt, n);
    mult(tt, aa, pp, n);
  }
}
int main() {
  static int cnt[1 << 4],
      aa[((1 << 4) * (12 + 1) * 2)][((1 << 4) * (12 + 1) * 2)],
      pp[((1 << 4) * (12 + 1) * 2)][((1 << 4) * (12 + 1) * 2)],
      tt[((1 << 4) * (12 + 1) * 2)][((1 << 4) * (12 + 1) * 2)];
  int n, k, m, b, c, h, head, ans;
  scanf("%d%d%d", &n, &k, &m);
  for (b = 1; b < 1 << m; b++) cnt[b] = cnt[b & b - 1] + 1;
  for (b = 0; b < 1 << m; b++)
    for (c = 0; c <= k; c++)
      for (head = 0; head < 2; head++) {
        int i, j, b_, c_, head_;
        i = (b * (k + 1) + c) * 2 + head;
        b_ = (b & (1 << m - 1) - 1) << 1, c_ = c, head_ = b >> m - 1;
        if (!head || !head_) {
          j = (b_ * (k + 1) + c_) * 2 + (head || head_);
          aa[i][j] = 1;
        }
        if (c < k) {
          c_ = c + 1;
          if (!head || !head_) {
            j = ((b_ | 1) * (k + 1) + c_) * 2 + (head || head_);
            aa[i][j] = 1;
            j = (b_ * (k + 1) + c_) * 2 + (head || head_);
            aa[i][j] = cnt[b] + head;
          }
          for (h = 0; h < m; h++)
            if (b & 1 << h) {
              b_ = ((b ^ 1 << h) & (1 << m - 1) - 1) << 1,
              head_ = (b ^ 1 << h) >> m - 1;
              if (!head || !head_) {
                j = ((b_ | 1) * (k + 1) + c_) * 2 + (head || head_);
                aa[i][j] = 1;
                j = (b_ * (k + 1) + c_) * 2 + (head || head_);
                aa[i][j] = cnt[b] + head - 1;
              }
            }
        }
      }
  power(aa, pp, tt, (1 << m) * (k + 1) * 2, n);
  c = k;
  ans = 0;
  for (b = 0; b < 1 << m; b++)
    for (head = 0; head < 2; head++)
      if (head == 0 && cnt[b] == 1 || head == 1 && b == 0) {
        int i = (b * (k + 1) + c) * 2 + head;
        ans = (ans + pp[0][i]) % 1000000007;
      }
  printf("%d\n", ans);
  return 0;
}
