#include <bits/stdc++.h>
#pragma warning(disable : 4996)
#pragma comment(linker, "/STACK:336777216")
using namespace std;
inline long long gcd(long long a, long long b) {
  if (a == 0) return b;
  return gcd(b % a, a);
}
inline long long power(long long a, long long n, long long m) {
  if (n == 0) return 1;
  long long p = power(a, n / 2, m);
  p = (p * p) % m;
  if (n % 2)
    return (p * a) % m;
  else
    return p;
}
const long long hell = 1000000007;
const int INF = 0x3f3f3f3f;
const long long LL_INF = 0x3f3f3f3f3f3f3f3f;
long long dp[101][10001];
long long f[101];
long long c[101][101];
long long dp1[101][101];
int32_t main() {
  std::ios::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  ;
  long long n, m, k;
  cin >> n >> m >> k;
  long long x = m / n, y;
  y = m % n;
  for (long long i = 0; i < n; i++) f[i] += x;
  for (long long i = 0; i < y; i++) f[i]++;
  c[0][0] = 1;
  for (long long i = 1; i <= 100; i++) {
    for (long long j = 0; j <= i; j++) {
      if (j == 0 || i == j)
        c[i][j] = 1;
      else
        c[i][j] = (c[i - 1][j - 1] % hell + c[i - 1][j] % hell) % hell;
    }
  }
  for (long long i = 0; i < n; i++) {
    for (long long j = 0; j <= n; j++) {
      dp1[i][j] = power(c[n][j], f[i], hell);
    }
  }
  dp[0][0] = 1;
  long long sum = 0;
  for (long long i = 1; i <= n; i++) {
    sum += n;
    for (long long s = 0; s <= min(sum, k); s++) {
      for (long long j = 0; j <= min(n, s); j++) {
        x = (dp[i - 1][s - j] % hell * dp1[i - 1][j] % hell) % hell;
        dp[i][s] = (dp[i][s] % hell + x % hell) % hell;
      }
    }
  }
  cout << dp[n][k] << "\n";
  return 0;
}
