#include <bits/stdc++.h>
using namespace std;
const int P = 1e9 + 7, INF = 0x3f3f3f3f;
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
long long qpow(long long a, long long n) {
  long long r = 1 % P;
  for (a %= P; n; a = a * a % P, n >>= 1)
    if (n & 1) r = r * a % P;
  return r;
}
long long inv(long long first) {
  return first <= 1 ? 1 : inv(P % first) * (P - P / first) % P;
}
inline int rd() {
  int first = 0;
  char p = getchar();
  while (p < '0' || p > '9') p = getchar();
  while (p >= '0' && p <= '9') first = first * 10 + p - '0', p = getchar();
  return first;
}
const int N = 1e5 + 10;
int n, k, m, cnt[N];
int dp[N][13][1 << 4];
int main() {
  scanf("%d%d%d", &n, &k, &m);
  dp[0][0][0] = 1;
  int mx = (1 << m) - 1;
  for (int i = 0; i <= mx; ++i) cnt[i] = __builtin_popcount(i);
  for (int i = 0; i <= n; ++i)
    for (int j = 0; j <= k; ++j)
      for (int s = 0; s <= mx; ++s) {
        (dp[i + 1][j][s >> 1] += dp[i][j][s]) %= P;
        int r = dp[i][j][s] * (1ll + cnt[s]) % P;
        if (j + 1 <= k) (dp[i + 1][j + 1][s >> 1 ^ 1 << m - 1] += r) %= P;
      }
  int ans = 0;
  for (int i = 0; i <= mx; ++i) (ans += dp[n][k][i]) %= P;
  printf("%d\n", ans);
}
