#include <bits/stdc++.h>
using namespace std;
int n, m, kk;
const int p = 1000000007;
int f[2][105][105][105];
int c[105][105];
void yu() {
  for (int i = 0; i <= 100; i++) {
    c[i][0] = 1;
    for (int 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;
    }
  }
  return;
}
int main() {
  scanf("%d%d%d", &n, &m, &kk);
  yu();
  f[0][0][0][1] = 1;
  int ans = 0;
  int now = 0, pre = 1;
  for (int i = 1; i <= m; i++) {
    now ^= 1;
    pre ^= 1;
    memset(f[now], 0, sizeof(f[now]));
    for (int j = 0; j < n; j++) {
      for (int k = (i != 1); k <= n; k++) {
        for (int o = 1; o <= kk; o++) {
          if (f[pre][j][k][o])
            for (int l = max(k, 1); l <= n - j; l++) {
              if (i == 1)
                (f[now][j + l][l - k][o] += f[pre][j][k][o]) %= p;
              else if (o * c[l - 1][k - 1] <= kk)
                (f[now][j + l][l - k][o * c[l - 1][k - 1]] +=
                 f[pre][j][k][o]) %= p;
            }
        }
      }
    }
    for (int j = 2; j <= n; j++) {
      for (int k = 1; k <= kk; k++) {
        (ans += 1LL * f[now][j][0][k] * (m - i + 1) % p) %= p;
      }
    }
  }
  printf("%d\n", ans);
  return 0;
}
