#include <bits/stdc++.h>
using namespace std;
inline int read() {
  int f = 1, x = 0;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = x * 10 + ch - '0';
    ch = getchar();
  }
  return x * f;
}
inline void write(int x) {
  if (x < 0) putchar('-'), x = -x;
  if (x > 9) write(x / 10);
  putchar(x % 10 + '0');
}
inline void pr1(int x) {
  write(x);
  printf(" ");
}
inline void pr2(int x) {
  write(x);
  puts("");
}
int n, m, K;
int C[105][105];
int f[2][105][105][105];
void ad(int &x, int y) {
  x += y;
  if (x >= 1000000007) x -= 1000000007;
}
int main() {
  n = read();
  m = read();
  K = read();
  if (n == 1) return puts("0"), 0;
  C[0][0] = 1;
  for (int i = 1; i <= 100; i++)
    for (int j = 0; j <= 100; j++) {
      C[i][j] = j ? C[i - 1][j] + C[i - 1][j - 1] : C[i - 1][j];
      if (C[i][j] > K) C[i][j] = K + 1;
    }
  n++;
  int now = 0, ans = 0;
  f[now][0][1][1] = 1;
  for (int i = 0; i <= m; i++) {
    now ^= 1;
    int num = 0;
    if (i) {
      for (int j = 2; j <= n; j++)
        for (int k = 1; k <= K; k++) ad(num, f[now ^ 1][j][0][k]);
      ad(ans, (long long)num * (m - i + 1) % 1000000007);
    }
    memset(f[now], 0, sizeof(f[now]));
    for (int j = 0; j <= n; j++)
      for (int k = 1; k <= n; k++)
        for (int l = 1; l <= K; l++)
          if (f[now ^ 1][j][k][l])
            for (int t = k; t + j <= n; t++)
              ad(f[now][j + t][t - k][min(K + 1, l * C[t - 1][k - 1])],
                 f[now ^ 1][j][k][l]);
  }
  pr2(ans);
  return 0;
}
