#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1 << 7;
const int INF = MAXN;
const int MOD = 1000000007;
int C[MAXN][MAXN];
int f[MAXN >> 1][MAXN >> 1][MAXN >> 1][MAXN];
void add(int &x, const int y) {
  x += y;
  (x >= MOD) && (x -= MOD);
}
int main() {
  for (int i = 0, j; i < MAXN; ++i)
    for (C[i][0] = C[i][i] = 1, j = 1; j < i; ++j) {
      C[i][j] = min(C[i - 1][j - 1] + C[i - 1][j], INF);
    }
  int tot = 0;
  int N, M, K, N2;
  scanf("%d%d%d", &N, &M, &K), N2 = N >> 1;
  f[0][1][0][1] = 1;
  for (int i = 0; i <= N2 && i < M; ++i)
    for (int j = 1; j <= N2; ++j) {
      for (int k = 0; k <= N2; ++k)
        for (int w = 0; w <= K; ++w) {
          int cc = f[i][j][k][w];
          if (!cc) continue;
          if (i) tot = (tot + (long long)cc * (M - i)) % MOD;
          for (int x = 1; x + k <= N2; ++x) {
            int nw = w * C[j + x - 1][x];
            if (nw > K) continue;
            add(f[i + 1][x][k + x][nw], cc);
          }
        }
    }
  printf("%d\n", tot);
  return 0;
}
