#include <bits/stdc++.h>
using namespace std;
int n, m, ans, K, C[105][105], f[2][105][105][105];
int read() {
  int x = 0, k = 1;
  char c;
  c = getchar();
  while (c < '0' || c > '9') {
    if (c == '-') k = -1;
    c = getchar();
  }
  while (c >= '0' && c <= '9') x = x * 10 + c - '0', c = getchar();
  return x * k;
}
void Upd(int &x, int y) { x = (x + y) % 1000000007; }
void Pre() {
  for (int i = 0; i < 105; i++) C[i][0] = 1;
  for (int i = 1; i < 105; i++)
    for (int j = 1; j < 105; j++) {
      C[i][j] = C[i - 1][j] + C[i - 1][j - 1];
      if (C[i][j] > 100) C[i][j] = 101;
    }
}
int main() {
  Pre();
  int now = 0, nxt = 1;
  n = read(), m = read(), K = read();
  for (int v = 0; v < m; v++) {
    for (int k = 1; k <= n; k++) Upd(f[nxt][k][k][1], 1);
    for (int i = 0; i < n; i++) {
      for (int g = 1; i + g <= n; g++)
        for (int l = 1; l <= K; l++) {
          if (!f[now][i][g][l]) continue;
          Upd(ans, f[now][i][g][l]);
          for (int k = g + 1; i + k <= n; k++) {
            int t = l * C[k - 1][g - 1];
            if (t > K) break;
            Upd(f[nxt][i + k][k - g][t], f[now][i][g][l]);
          }
          f[now][i][g][l] = 0;
        }
    }
    swap(now, nxt);
  }
  printf("%d\n", ans);
  return 0;
}
