#include <bits/stdc++.h>
using namespace std;
long long add(long long a, long long b, long long c) {
  long long res = a + b;
  return (res >= c ? res - c : res);
}
long long mod_neg(long long a, long long b, long long c) {
  long long res;
  if (abs(a - b) < c)
    res = a - b;
  else
    res = (a - b) % c;
  return (res < 0 ? res + c : res);
}
long long mul(long long a, long long b, long long c) {
  long long res = (long long)a * b;
  return (res >= c ? res % c : res);
}
template <typename T>
T power(T e, T n) {
  T x = 1, p = e;
  while (n) {
    if (n & 1) x = x * p;
    p = p * p;
    n >>= 1;
  }
  return x;
}
template <typename T>
T mdpower(T e, T n, T m) {
  T x = 1, p = e;
  while (n) {
    if (n & 1) x = mul(x, p, m);
    p = mul(p, p, m);
    n >>= 1;
  }
  return x;
}
template <typename T>
T extended_euclid(T a, T b, T &x, T &y) {
  T xx = 0, yy = 1;
  y = 0;
  x = 1;
  while (b) {
    T q = a / b, t = b;
    b = a % b;
    a = t;
    t = xx;
    xx = x - q * xx;
    x = t;
    t = yy;
    yy = y - q * yy;
    y = t;
  }
  return a;
}
template <typename T>
T mod_inverse(T a, T n) {
  T x, y, z = 0;
  T d = extended_euclid(a, n, x, y);
  return (d > 1 ? -1 : mod_neg(x, z, n));
}
const long long N = 105;
long long ways[N][N];
long long dp[N][10005];
long long fact[100005];
long long invFact[100005];
void __init_() {
  fact[0] = 1LL;
  for (long long i = 1; i < 100005; i++)
    fact[i] = (fact[i - 1] % 1000000007 * i % 1000000007) % 1000000007;
  invFact[0] = 1LL;
  for (long long i = 1; i < 100005; i++) {
    long long dd = mdpower(i, (long long)1000000007 - 2, (long long)1000000007);
    invFact[i] = (invFact[i - 1] % 1000000007 * dd % 1000000007) % 1000000007;
  }
}
long long ncr(long long n, long long r) {
  return ((fact[n] % 1000000007 * invFact[r] % 1000000007) % 1000000007 *
          invFact[n - r] % 1000000007) %
         1000000007;
}
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  __init_();
  long long n, m, k;
  cin >> n >> m >> k;
  for (long long i = 1; i <= n; i++) {
    for (long long j = 0; j <= n; j++) {
      long long temp = ncr(n, j) % 1000000007;
      ways[i][j] = mdpower(temp, ((m - i) / n) + 1LL, (long long)1000000007) %
                   1000000007;
    }
  }
  dp[0][0] = 1;
  for (long long i = 1; i <= n; i++) {
    for (long long j = 0; j <= k; j++) {
      for (long long l = 0; l <= n; l++) {
        if (j - l >= 0) {
          dp[i][j] = (dp[i][j] % 1000000007 + (dp[i - 1][j - l] % 1000000007 *
                                               ways[i][l] % 1000000007) %
                                                  1000000007) %
                     1000000007;
        }
      }
    }
  }
  cout << dp[n][k] << "\n";
  cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
}
