#include <bits/stdc++.h>
using namespace std;
const int MXN = (int)3e2 + 7;
const int mod = (int)1e9 + 7;
int add(int v1, int v2) {
  v1 += v2;
  if (v1 >= mod) v1 -= mod;
  return v1;
}
struct Mat {
  int n, m;
  long long a[MXN][MXN];
  void init(int _n, int _m) {
    n = _n, m = _m;
    for (int i = 0; i < n; i++)
      for (int j = 0; j < m; j++) {
        a[i][j] = 0;
      }
  }
  Mat operator*(const Mat &p2) {
    Mat res;
    res.init(n, p2.m);
    for (int i = 0; i < n; i++)
      for (int j = 0; j < m; j++)
        for (int k = 0; k < p2.m; k++) {
          res.a[i][k] = (res.a[i][k] + a[i][j] * p2.a[j][k]) % mod;
        }
    return res;
  }
  Mat operator^(const long long &p2) {
    long long t = p2 - 1;
    Mat res = *this, x = *this;
    while (t) {
      if (t & 1) res = res * x;
      t >>= 1;
      x = x * x;
    }
    return res;
  }
} a;
int main() {
  int n, k, m;
  scanf("%d %d %d", &n, &k, &m);
  a.init((k + 1) * (1 << m), (k + 1) * (1 << m));
  for (int j = 0; j <= k; j++) {
    for (int mask = 0; mask < (1 << m); mask++) {
      int nxt = (mask << 1) % (1 << m);
      int v1 = j * (1 << m) + mask;
      int v2 = j * (1 << m) + nxt;
      a.a[v2][v1] = 1;
      if (j != k) {
        int num = __builtin_popcount(mask) + 1;
        v2 = (j + 1) * (1 << m) + nxt + 1;
        a.a[v2][v1] = num;
      }
    }
  }
  a = a ^ n;
  int ans = 0;
  for (int mask = 0; mask < (1 << m); mask++) {
    int v = k * (1 << m) + mask;
    ans = add(ans, a.a[v][0]);
  }
  printf("%d\n", ans);
  return 0;
}
