#include <bits/stdc++.h>
using namespace std;
const double EPS = 1e-9;
template <std::uint_fast64_t Modulus>
class modint {
  using u64 = std::uint_fast64_t;
  u64 a;

 public:
  constexpr modint(const u64 x = 0) noexcept : a(x % Modulus) {}
  constexpr u64 value() const noexcept { return a; }
  constexpr modint operator+(const modint rhs) const noexcept {
    return modint(*this) += rhs;
  }
  constexpr modint operator-(const modint rhs) const noexcept {
    return modint(*this) -= rhs;
  }
  constexpr modint operator*(const modint rhs) const noexcept {
    return modint(*this) *= rhs;
  }
  constexpr modint operator/(const modint rhs) const noexcept {
    return modint(*this) /= rhs;
  }
  modint &operator+=(const modint rhs) noexcept {
    a += rhs.a;
    if (a >= Modulus) {
      a -= Modulus;
    }
    return *this;
  }
  modint &operator-=(const modint rhs) noexcept {
    if (a < rhs.a) {
      a += Modulus;
    }
    a -= rhs.a;
    return *this;
  }
  modint &operator*=(const modint rhs) noexcept {
    a = a * rhs.a % Modulus;
    return *this;
  }
  modint &operator/=(modint rhs) noexcept {
    u64 exp = Modulus - 2;
    while (exp) {
      if (exp % 2) {
        *this *= rhs;
      }
      rhs *= rhs;
      exp /= 2;
    }
    return *this;
  }
};
using mint = modint<1000000007>;
long long m;
vector<mint> matmul(vector<mint> &dp, vector<vector<mint>> &mt) {
  vector<mint> ret(m, 0);
  for (long long i = (0); i < (m); i++)
    for (long long j = (0); j < (m); j++) ret[i] += mt[i][j] * dp[j];
  return ret;
}
vector<vector<mint>> update(vector<vector<mint>> &mt) {
  vector<vector<mint>> ret(m, vector<mint>(m, 0));
  for (long long i = (0); i < (m); i++)
    for (long long j = (0); j < (m); j++)
      for (long long k = (0); k < (m); k++) ret[i][j] += mt[i][k] * mt[k][j];
  return ret;
}
void matpow(vector<mint> &dp, vector<vector<mint>> &mt, long long k) {
  while (k) {
    if (k % 2) dp = matmul(dp, mt);
    mt = update(mt);
    k /= 2;
  }
}
signed main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  long long n, k, l;
  cin >> n >> k >> l;
  long long M = 1 << l;
  m = M * (k + 2);
  vector<vector<mint>> mt(M * (k + 2), vector<mint>(M * (k + 2), 0));
  for (long long i = (0); i < (k + 1); i++) {
    for (long long j = (0); j < (M); j++) {
      long long mask = (j << 1) & (M - 1);
      mt[i * M + mask][i * M + j] += 1;
      mt[(i + 1) * M + (mask | 1)][i * M + j] += __builtin_popcount(j) + 1;
    }
  }
  vector<mint> dp(M * (k + 2), 0);
  dp[0] = 1;
  matpow(dp, mt, n);
  mint ans = 0;
  for (long long i = (0); i < (M); i++) ans += dp[M * k + i];
  cout << ans.value() << endl;
  return 0;
}
