#include <bits/stdc++.h>
using namespace std;
const int maxN = 212, MOD = 1e9 + 7;
long long tmp[maxN][maxN];
void mult(long long one[maxN][maxN], long long two[maxN][maxN],
          long long resp[maxN][maxN]) {
  memset(tmp, 0, sizeof tmp);
  for (int i = 0; i < maxN; i++)
    for (int j = 0; j < maxN; j++)
      for (int k = 0; k < maxN; k++)
        tmp[i][j] = (tmp[i][j] + one[i][k] * two[k][j]) % MOD;
  memcpy(resp, tmp, sizeof tmp);
}
long long ott[maxN][maxN];
void fastPow(long long one[maxN][maxN], long long b,
             long long resp[maxN][maxN]) {
  memset(ott, 0, sizeof ott);
  for (int i = 0; i < maxN; i++) ott[i][i] = 1;
  while (b) {
    if (b & 1) mult(ott, one, ott);
    b >>= 1;
    mult(one, one, one);
  }
  memcpy(resp, ott, sizeof ott);
}
int n, m, k;
long long base[maxN][maxN], strt[maxN][maxN];
void consider(int to, int fr, int x, int cnd) {
  for (int i = 0; i + cnd <= k; i++) {
    base[(i + cnd) * (1 << m) + to][i * (1 << m) + fr] = x;
  }
}
int coun(int x) {
  int ret = 0;
  while (x) {
    if (x & 1) ret++;
    x >>= 1;
  }
  return ret;
}
int main() {
  cin >> n >> k >> m;
  for (int i = 0; i < (1 << m); i++) {
    int cr = i >> 1;
    consider(cr, i, 1, 0);
    cr |= 1 << (m - 1);
    consider(cr, i, coun(i) + 1, 1);
  }
  strt[0][0] = 1;
  fastPow(base, n, base);
  mult(base, strt, base);
  long long ans = 0;
  for (int i = 0; i < (1 << m); i++)
    ans = (ans + base[k * (1 << m) + i][0]) % MOD;
  cout << ans << '\n';
}
