#include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
int sum, n, m, w, f[60][60][60][110], c[110][110], tmp, temp;
int main() {
  for (int i = 0; i <= 100; i++) {
    c[i][0] = c[i][i] = 1;
    for (int j = 1; j < i; j++) {
      c[i][j] = min(c[i - 1][j] + c[i - 1][j - 1], 200);
      if (c[i][j] >= mod) c[i][j] -= mod;
    }
  }
  scanf("%d%d%d", &n, &m, &w);
  n >>= 1;
  f[0][1][0][1] = 1;
  for (int i = 0; i <= n && i < m; i++)
    for (int j = 1; j <= n; j++)
      for (int k = 0; k <= n; k++)
        for (int l = 0; l <= w; l++) {
          tmp = f[i][j][k][l] % mod;
          if (!tmp) continue;
          if (i) sum = (sum + (long long)tmp * (m - i)) % mod;
          for (int r = 1; r <= n - k; r++) {
            temp = l * c[j + r - 1][j - 1];
            if (temp > w) continue;
            f[i + 1][r][k + r][temp] += tmp;
            if (f[i + 1][r][k + r][temp] >= mod)
              f[i + 1][r][k + r][temp] -= mod;
          }
        }
  printf("%d\n", sum);
  return 0;
}
