#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
vector<vector<int>> mul(const vector<vector<int>>& A,
                        const vector<vector<int>>& B) {
  if (A[0].size() != B.size()) {
    throw out_of_range("Nu poti face inmultire");
  }
  vector<vector<int>> C(A.size(), vector<int>(B[0].size()));
  for (int i = 0; i < (int)C.size(); ++i)
    for (int k = 0; k < (int)A[0].size(); ++k)
      for (int j = 0; j < (int)C[0].size(); ++j)
        C[i][j] = (C[i][j] + 1LL * A[i][k] * B[k][j]) % mod;
  return C;
}
vector<vector<int>> Identity(int n) {
  vector<vector<int>> M(n, vector<int>(n));
  for (int i = 0; i < n; ++i) M[i][i] = 1;
  return M;
}
int main() {
  int n, k, m;
  cin >> n >> k >> m;
  vector<vector<int>> dp(k + 1, vector<int>(1 << m));
  vector<vector<int>> ndp = dp;
  vector<int> nb(1 << m);
  for (int i = 1; i < (1 << m); ++i) nb[i] = nb[i - (i & -i)] + 1;
  auto getMatrix = [&]() {
    int stari = (1 << m) * (k + 1);
    vector<vector<int>> mat(stari, vector<int>(stari));
    vector<vector<int>> id(k + 1, vector<int>(1 << m));
    int NEXT_FREE_ID = 0;
    for (int iau = 0; iau <= k; ++iau)
      for (int mask = 0; mask < 1 << m; ++mask) id[iau][mask] = NEXT_FREE_ID++;
    for (int iau = 0; iau <= k; ++iau) {
      for (int mask = 0; mask < 1 << m; ++mask) {
        int nmask = mask;
        if (nmask & (1 << (m - 1))) {
          nmask -= 1 << (m - 1);
        }
        nmask <<= 1;
        mat[id[iau][mask]][id[iau][nmask]]++;
        if (iau + 1 <= k) {
          nmask++;
          mat[id[iau][mask]][id[iau + 1][nmask]] += nb[mask] + 1;
        }
      }
    }
    return mat;
  };
  vector<vector<int>> raise = getMatrix();
  vector<vector<int>> curr = Identity(raise.size());
  for (int y = n; y > 0; y /= 2) {
    if (y & 1) {
      curr = mul(curr, raise);
    }
    raise = mul(raise, raise);
  }
  int res = 0;
  for (int i = 0; i < (1 << m); ++i)
    res = (res + curr[0][k * (1 << m) + i]) % mod;
  cout << res;
}
