#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int inf = 0x3f3f3f3f;
const int maxn = 1e5 + 5;
const int mod = 1e9 + 7;
struct Matrix {
  ll m[210][210];
  int n;
  Matrix(int _n = 0, int _v = 0) {
    n = _n;
    for (int i = 0; i < n; i++)
      for (int j = 0; j < n; j++) m[i][j] = (i == j) ? _v : 0;
  }
  Matrix operator*(const Matrix& o) const {
    Matrix ret(n, 0);
    for (int k = 0; k < n; k++)
      for (int i = 0; i < n; i++)
        for (int j = 0; j < n; j++) (ret.m[i][j] += m[i][k] * o.m[k][j]) %= mod;
    return ret;
  }
  Matrix operator^(int k) const {
    Matrix ret(n, 1), A = *this;
    while (k) {
      if (k & 1) ret = ret * A;
      A = A * A;
      k >>= 1;
    }
    return ret;
  }
  void show() {
    for (int i = 0; i < n; i++)
      for (int j = 0; j < n; j++) cout << m[i][j] << " \n"[j == n - 1];
  }
};
int n, k, m, N;
int getCol(int i, int s) { return i * (N + 1) + s; }
int main() {
  cin >> n >> k >> m;
  N = (1 << m) - 1;
  Matrix A((k + 1) * (N + 1), 0);
  for (int i = 0; i <= k; i++)
    for (int s = 0; s <= N; s++) {
      int ns = (s << 1) & N;
      int c = getCol(i, s);
      A.m[c][getCol(i, ns)] += 1;
      if (i < k) {
        A.m[c][getCol(i + 1, ns | 1)] += __builtin_popcount(s) + 1;
      }
    }
  A = A ^ n;
  ll ans = 0;
  for (int i = 0; i <= N; i++) ans += A.m[0][getCol(k, i)];
  cout << ans % mod << endl;
  return 0;
}
