#include <bits/stdc++.h>
using namespace std;
const int maxn = 13 * 16 + 5;
const int mod = 1e9 + 7;
int n, k, m, len;
struct matrix {
  int m, n, a[maxn][maxn];
  matrix(int _m = 0, int _n = 0) {
    m = _m;
    n = _n;
    memset(a, 0, sizeof(a));
  }
  matrix operator*(const matrix &b) const {
    matrix ans(m, b.n);
    for (int i = 0; i < m; ++i)
      for (int j = 0; j < b.n; ++j)
        for (int k = 0; k < n; ++k)
          ans.a[i][j] = (ans.a[i][j] + (long long)a[i][k] * b.a[k][j]) % mod;
    return ans;
  }
} res, a;
void fpow(int k) {
  while (k) {
    if (k & 1) res = res * a;
    a = a * a;
    k >>= 1;
  }
}
int main() {
  cin >> n >> k >> m;
  res.m = res.n = a.m = a.n = len = (k + 1) * (1 << m);
  for (int i = 0; i < len; i++) res.a[i][i] = 1;
  for (int i = 0; i <= k; i++)
    for (int j = 0; j < (1 << m); j++) {
      int tp = (j << 1) % (1 << m);
      a.a[i * (1 << m) + j][i * (1 << m) + tp] = 1;
      if (i < k)
        a.a[i * (1 << m) + j][(i + 1) * (1 << m) + tp + 1] =
            __builtin_popcount(j) + 1;
    }
  fpow(n);
  memset(a.a, 0, sizeof a.a);
  a.a[0][0] = 1;
  a = a * res;
  long long ans = 0;
  for (int i = 0; i < (1 << m); i++) (ans += a.a[0][k * (1 << m) + i]) %= mod;
  cout << ans << endl;
  return 0;
}
