#include <bits/stdc++.h>
using namespace std;
const int N = 110, mod = 1e9 + 7;
int f[N][N][N], g[N][N][N], c[N][N];
void init() {
  for (int i = 0; i <= N; i++) {
    c[i][0] = c[i][i] = 1;
    for (int j = 1; j <= i - 1; j++)
      c[i][j] = (c[i - 1][j - 1] + c[i - 1][j]) % mod;
  }
}
inline void add(int &a, int b) {
  a += b;
  if (a > mod) a -= mod;
}
int main() {
  int n, m, K;
  scanf("%d%d%d", &n, &m, &K);
  init();
  int ans = 0;
  for (int t = 1; t <= m; t++) {
    for (int t = 1; t <= n; t++) g[t][1][t] = 1;
    for (int i = 1; i <= n; i++)
      for (int k = 1; k <= K; k++)
        for (int j = 0; j <= n; j++)
          if (f[i][k][j]) {
            int tmp;
            for (int t = j; t <= n - i; t++)
              if (c[t - 1][j - 1] <= K && (tmp = k * c[t - 1][j - 1]) <= K)
                add(g[i + t][tmp][t - j], f[i][k][j]);
              else
                break;
            f[i][k][j] = 0;
          }
    swap(f, g);
    for (int i = 1; i <= n; i++)
      for (int k = 1; k <= K; k++)
        if (f[i][k][0]) (ans += f[i][k][0]) %= mod;
  }
  printf("%d\n", ans);
  return 0;
}
