#include <bits/stdc++.h>
using namespace std;
int n, m, p, ans, mod = 1000000007;
int c[110][110], f[110][60][60][110];
void update(int &i, int x) { i = (i + x) % mod; }
int main() {
  int i, j, k, p1, x;
  scanf("%d%d%d", &n, &m, &p);
  for (i = 0; i <= n; i++) {
    c[i][0] = 1;
    for (j = 1; j <= i; j++) c[i][j] = min(c[i - 1][j - 1] + c[i - 1][j], 200);
  }
  for (i = 2; i <= n; i += 2) f[i][1][i / 2][1] = 1;
  for (i = 0; i <= n; i++)
    for (j = 1; j <= m && j <= n / 2; j++)
      for (k = 0; k <= n / 2; k++)
        for (p1 = 1; p1 <= p; p1++) {
          if (f[i][j][k][p1] == 0) continue;
          if (i > 1)
            ans = (ans + (long long)(m - j) * f[i][j][k][p1] % mod) % mod;
          for (x = 1; i + x + x <= n; x++) {
            if (p1 * c[k + x - 1][x] > p) continue;
            update(f[i + x + x][j + 1][x][p1 * c[k + x - 1][x]],
                   f[i][j][k][p1]);
          }
        }
  printf("%d\n", ans);
  return 0;
}
