#include <bits/stdc++.h>
using namespace std;
int C[110][110];
int f[2][110][110][110];
int main() {
  int n, m, k, i, j, x, y, l, ans;
  scanf("%d%d%d", &n, &m, &k);
  for (i = 0; i <= n; i++) {
    C[i][0] = 1;
    for (j = 1; j <= i; j++) {
      C[i][j] = C[i - 1][j - 1] + C[i - 1][j];
      if (C[i][j] > 100) C[i][j] = 101;
    }
  }
  ans = 0;
  for (i = 0; i < m; i++) {
    for (j = 1; j <= n; j++) f[i & 1][j][j][1] = 1;
    for (j = 0; j <= n; j++) {
      for (x = 1; j + x <= n; x++) {
        for (y = 1; y <= k; y++) {
          if (f[!(i & 1)][j][x][y] == 0) continue;
          (ans += f[!(i & 1)][j][x][y]) %= 1000000007;
          for (l = x + 1; j + l <= n; l++) {
            if (C[l - 1][x - 1] * y > k) continue;
            (f[i & 1][j + l][l - x][C[l - 1][x - 1] * y] +=
             f[!(i & 1)][j][x][y]) %= 1000000007;
          }
          f[!(i & 1)][j][x][y] = 0;
        }
      }
    }
  }
  printf("%d\n", ans);
  return 0;
}
