#include <bits/stdc++.h>
const long long maxn = 1e4 + 10;
inline long long Max(long long a, long long b) { return a > b ? a : b; }
inline long long Min(long long a, long long b) { return a > b ? b : a; }
inline long long read() {
  long long f = 1, r = 0;
  char c = getchar();
  while (!isdigit(c)) {
    if (c == '-') {
      f = -1;
    }
    c = getchar();
  }
  while (isdigit(c)) {
    r = 10 * r + c - '0';
    c = getchar();
  }
  return f * r;
}
inline void write(long long x) {
  if (x < 0) putchar('-'), x = -x;
  if (x > 9) write(x / 10);
  putchar(x % 10 + '0');
}
inline void writesp(long long x) { write(x), putchar(' '); }
inline void writeln(long long x) { write(x), puts(""); }
long long N, M, K, dp[105][maxn], fac[105], C[105], cache[105][maxn];
inline long long exgcd(long long a, long long b, long long& x, long long& y) {
  if (b == 0) {
    x = 1, y = 0;
    return a;
  }
  long long d = exgcd(b, a % b, x, y);
  long long tmp = y;
  y = x - a / b * y, x = tmp;
  return d;
}
inline long long inv(long long a) {
  long long x, y;
  exgcd(a, 1000000007, x, y);
  x = (x + 1000000007) % 1000000007;
  return x;
}
inline long long quick_power(long long x, long long b) {
  long long res = 1;
  while (b) {
    if (b & 1) res = (res * x) % 1000000007;
    x = (x * x) % 1000000007, b >>= 1;
  }
  return res % 1000000007;
}
long long getfuck(long long pos, long long num) {
  long long t = (M - pos + N) / N;
  long long res = quick_power(C[num], t);
  return res;
}
signed main() {
  N = read(), M = read(), K = read();
  fac[0] = 1;
  for (register long long i = 1; i <= 100; ++i) {
    fac[i] = fac[i - 1] * i % 1000000007;
  }
  for (register long long i = 0; i <= 100; ++i) {
    C[i] = fac[N] * inv(fac[i]) % 1000000007 * inv(fac[N - i]) % 1000000007;
  }
  for (long long i = 1; i <= N; ++i) {
    for (register long long j = 0; j <= N; ++j) {
      cache[i][j] = getfuck(i, j);
    }
  }
  dp[0][0] = 1;
  for (register long long i = 1; i <= N; ++i) {
    for (register long long j = 0; j <= Min(K, i * N); ++j) {
      for (register long long k = 0; k <= Min(N, j); ++k) {
        dp[i][j] = (dp[i][j] + dp[i - 1][j - k] * cache[i][k]) % 1000000007;
      }
    }
  }
  writeln(dp[N][K]);
  return 0;
}
