#include <bits/stdc++.h>
using namespace std;
const long long linf = 1e18 + 5;
const int mod = (int)1e9 + 7;
const int logN = 17;
const int inf = 1e9;
const int N = 101;
int C[N][N], n, m, k, dp[N][80][80][N];
inline int comb(int n, int m) { return C[m - 1][n - 1]; }
int f(int x, int last, int gr, int ways) {
  if (gr == 0) return (1 <= ways) * (m - last + 2);
  if (last > m) return 0;
  int &r = dp[x][last][gr][ways];
  if (r != -1) return r;
  r = 0;
  for (int i = gr; i <= n - x; i++)
    if (comb(gr, i) * ways <= k)
      r = (r + f(x + i, last + 1, i - (gr - (last == 1)), ways * comb(gr, i))) %
          mod;
  return r;
}
int main() {
  scanf("%d %d %d", &n, &m, &k);
  C[0][0] = 1;
  for (int i = 1; i <= 100; i++) {
    C[i][0] = 1;
    for (int j = 1; j <= i; j++) {
      C[i][j] = C[i - 1][j] + C[i - 1][j - 1];
      if (C[i][j] > k) C[i][j] = k + 1;
    }
  }
  memset(dp, -1, sizeof dp);
  cout << f(0, 1, 1, 1) << '\n';
  return 0;
}
