#include <bits/stdc++.h>
long long dx[8] = {0, 1, 0, -1, 1, 1, -1, -1};
long long dy[8] = {1, 0, -1, 0, -1, 1, 1, -1};
using namespace std;
class pa3 {
 public:
  long long x;
  long long y, z;
  pa3(long long x = 0, long long y = 0, long long z = 0) : x(x), y(y), z(z) {}
  bool operator<(const pa3 &p) const {
    if (x != p.x) return x < p.x;
    if (y != p.y) return y < p.y;
    return z < p.z;
  }
  bool operator>(const pa3 &p) const {
    if (x != p.x) return x > p.x;
    if (y != p.y) return y > p.y;
    return z > p.z;
  }
  bool operator==(const pa3 &p) const {
    return x == p.x && y == p.y && z == p.z;
  }
  bool operator!=(const pa3 &p) const {
    return !(x == p.x && y == p.y && z == p.z);
  }
};
class pa4 {
 public:
  long long x;
  long long y, z, w;
  pa4(long long x = 0, long long y = 0, long long z = 0, long long w = 0)
      : x(x), y(y), z(z), w(w) {}
  bool operator<(const pa4 &p) const {
    if (x != p.x) return x < p.x;
    if (y != p.y) return y < p.y;
    if (z != p.z) return z < p.z;
    return w < p.w;
  }
  bool operator>(const pa4 &p) const {
    if (x != p.x) return x > p.x;
    if (y != p.y) return y > p.y;
    if (z != p.z) return z > p.z;
    return w > p.w;
  }
  bool operator==(const pa4 &p) const {
    return x == p.x && y == p.y && z == p.z && w == p.w;
  }
};
class pa2 {
 public:
  long long x, y;
  pa2(long long x = 0, long long y = 0) : x(x), y(y) {}
  pa2 operator+(pa2 p) { return pa2(x + p.x, y + p.y); }
  pa2 operator-(pa2 p) { return pa2(x - p.x, y - p.y); }
  bool operator<(const pa2 &p) const { return y != p.y ? y < p.y : x < p.x; }
  bool operator>(const pa2 &p) const { return x != p.x ? x < p.x : y < p.y; }
  bool operator==(const pa2 &p) const {
    return abs(x - p.x) == 0 && abs(y - p.y) == 0;
  }
  bool operator!=(const pa2 &p) const {
    return !(abs(x - p.x) == 0 && abs(y - p.y) == 0);
  }
};
string itos(long long i) {
  ostringstream s;
  s << i;
  return s.str();
}
long long gcd(long long v, long long b) {
  if (v > b) return gcd(b, v);
  if (v == b) return b;
  if (b % v == 0) return v;
  return gcd(v, b % v);
}
long long mod;
long long extgcd(long long a, long long b, long long &x, long long &y) {
  if (b == 0) {
    x = 1;
    y = 0;
    return a;
  }
  long long d = extgcd(b, a % b, y, x);
  y -= a / b * x;
  return d;
}
pair<long long, long long> operator+(const pair<long long, long long> &l,
                                     const pair<long long, long long> &r) {
  return {l.first + r.first, l.second + r.second};
}
pair<long long, long long> operator-(const pair<long long, long long> &l,
                                     const pair<long long, long long> &r) {
  return {l.first - r.first, l.second - r.second};
}
long long pr[200010];
long long inv[200010];
long long beki(long long wa, long long rr, long long warukazu) {
  if (rr == 0) return 1 % warukazu;
  if (rr == 1) return wa % warukazu;
  wa %= warukazu;
  if (rr % 2 == 1)
    return ((long long)beki(wa, rr - 1, warukazu) * (long long)wa) % warukazu;
  long long zx = beki(wa, rr / 2, warukazu);
  return (zx * zx) % warukazu;
}
long long comb(long long nn, long long rr) {
  if (rr < 0 || rr > nn || nn < 0) return 0;
  long long r = pr[nn] * inv[rr];
  r %= mod;
  r *= inv[nn - rr];
  r %= mod;
  return r;
}
void gya(long long ert) {
  pr[0] = 1;
  for (long long i = 1; i <= ert; i++) {
    pr[i] = (pr[i - 1] * i) % mod;
  }
  inv[ert] = beki(pr[ert], mod - 2, mod);
  for (long long i = ert - 1; i >= 0; i--) {
    inv[i] = inv[i + 1] * (i + 1) % mod;
  }
}
using TT = array<array<long long, 200>, 200>;
TT P;
TT kake(TT Q, TT R) {
  TT ans;
  for (long long i = 0; i < 200; i++)
    for (long long j = 0; j < 200; j++)
      for (long long k = 0; k < 200; k++) {
        ans[i][j] += Q[i][k] * R[k][j] % 1000000007;
        if (ans[i][j] >= 1000000007) ans[i][j] -= 1000000007;
      }
  return ans;
}
void tasu(TT &Q, TT R) {
  for (long long i = 0; i < 200; i++)
    for (long long j = 0; j < 200; j++) {
      Q[i][j] += R[i][j];
      if (Q[i][j] >= 1000000007) Q[i][j] -= 1000000007;
    }
}
TT beki2(TT Q, long long k) {
  cout << k << endl;
  TT ima;
  for (long long i = 32; i >= 0; i--) {
    cout << i << endl;
    ima = kake(ima, ima);
    if (k & (1ll << i)) tasu(ima, Q);
  }
  return ima;
}
TT beki1(TT Q, long long k) {
  if (k == 1) return Q;
  if (k % 2) return kake(beki1(Q, k - 1), Q);
  TT hoge = beki1(Q, k / 2);
  return kake(hoge, hoge);
}
signed main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  long long n, k, m;
  cin >> n >> k >> m;
  for (long long i = 0; i <= 192; i++) {
    if (i == 192) {
      P[i][192] = 1;
      P[i][1] = 1;
      continue;
    }
    long long kosu = 1 + i / 16;
    long long bit = i % 16;
    if (bit >= (1 << m)) continue;
    if (kosu == k) {
      P[i][i] = 1;
      continue;
    }
    if (kosu > k) {
      continue;
    }
    long long newbit = 2 * bit;
    if (newbit & (1 << m)) newbit ^= (1 << m);
    P[i][(kosu - 1) * 16 + newbit] = 1;
    P[i][(kosu)*16 + newbit + 1] = __builtin_popcount(bit) + 1;
  }
  TT W;
  W = beki1(P, n);
  long long ans = 0;
  for (long long i = (k - 1) * 16; i < k * 16; i++) ans += W[192][i];
  cout << ans % 1000000007 << endl;
  return 0;
}
