#include <bits/stdc++.h>
using namespace std;
long long dp[10001][101];
long long c[101][101];
long long fac[101];
long long M[101][101];
long long Montgomery(long long a, long long b, long long m) {
  long long k = 1, temp = 0, c;
  temp = a % m;
  if ((b & 1) == 1) k *= temp;
  b >>= 1;
  while (b != 0) {
    c = b & 1;
    temp = temp * temp % m;
    if (c != 0) k *= temp;
    if (k >= m) k %= m;
    b >>= 1;
  }
  return k;
}
void factorial() {
  fac[0] = 1;
  for (int i = 1; i < 101; i++) fac[i] = (fac[i - 1] * i) % 1000000007;
}
void pre(long long div, int m) {
  for (int n = 1; n <= m; n++)
    for (int kk = 0; kk <= n; kk++)
      M[n][kk] = Montgomery(c[n][kk], div, 1000000007);
}
void get() {
  factorial();
  for (int i = 0; i <= 100; i++)
    for (int j = 0; j <= i; j++) {
      if (i == 0 && j == 0) continue;
      if (j > i - j)
        c[i][j] = c[i][i - j];
      else {
        c[i][j] = Montgomery(fac[j], 1000000007 - 2, 1000000007);
        for (int k = i - j + 1; k <= i; k++) {
          c[i][j] = c[i][j] * k % 1000000007;
        }
      }
    }
}
int main() {
  get();
  long long n, m, k;
  memset(dp, 0, sizeof(dp));
  cin >> n >> m >> k;
  if (k > n * n - k) k = n * n - k;
  long long div = m / n;
  pre(div, n);
  int rem = m % n;
  for (int i = 1; i <= n; i++) dp[0][i] = 1;
  for (int i = 1; i <= k; i++) {
    if (i > n) {
      dp[i][1] = 0;
      continue;
    }
    if (rem >= 1)
      dp[i][1] = (M[n][i] * c[n][i]) % 1000000007;
    else
      dp[i][1] = M[n][i];
  }
  for (int i = 1; i <= k; i++)
    for (int j = 2; j <= n; j++) {
      dp[i][j] = 0;
      if (i > j * n) continue;
      if (rem >= j) {
        for (int kk = 0; kk <= n && kk <= i; kk++) {
          dp[i][j] += ((M[n][kk] * c[n][kk]) % 1000000007) * dp[i - kk][j - 1];
          dp[i][j] %= 1000000007;
        }
      } else {
        for (int kk = 0; kk <= n && kk <= i; kk++) {
          dp[i][j] += (M[n][kk] * dp[i - kk][j - 1]);
          dp[i][j] %= 1000000007;
        }
      }
    }
  cout << dp[k][n] << endl;
  return 0;
}
