#include <bits/stdc++.h>
using namespace std;
const int maxn = 102;
const long long mod = 1e9 + 7;
long long dp[maxn][maxn * maxn], m, C[maxn][maxn], f[maxn];
int n, k, p[maxn];
int check(int x) {
  if (x <= m % n) return 1;
  return 0;
}
inline void init() {
  for (int i = 0; i < maxn; i++) {
    C[i][0] = C[i][i] = 1;
    for (int j = 1; j < i; j++) C[i][j] = (C[i - 1][j] + C[i - 1][j - 1]) % mod;
  }
}
long long pow_mod(long long x, long long y) {
  long long s = 1, base = x;
  while (y) {
    if (y & 1) s = s * base % mod;
    base = base * base % mod;
    y >>= 1;
  }
  return s;
}
int main() {
  init();
  cin >> n >> m >> k;
  dp[0][0] = 1;
  for (int i = 1; i <= n; i++) p[i] = check(i);
  for (int i = 0; i <= n; i++) f[i] = pow_mod(C[n][i], m / n);
  for (int i = 1; i <= n; i++) {
    for (int j = 0; j <= n; j++) {
      for (int u = 0; u <= (i - 1) * n; u++) {
        if (u + j > k || u + j + (n - i) * n < k) continue;
        long long tep = f[j];
        if (p[i]) tep = tep * C[n][j] % mod;
        dp[i][j + u] = (dp[i][j + u] + dp[i - 1][u] * tep) % mod;
      }
    }
  }
  cout << dp[n][k] << endl;
  return 0;
}
