#include <bits/stdc++.h>
using namespace std;
long long C[110][110];
void pre() {
  C[0][0] = 1;
  for (int i = 1; i < 110; i++) {
    C[i][0] = 1;
    for (int j = 1; j <= i; j++) {
      C[i][j] = (C[i - 1][j] + C[i - 1][j - 1]) % 1000000007;
    }
  }
}
long long int mypow(long long int a, long long int b) {
  long long int r = 1;
  while (b != 0) {
    if (b % 2 == 1) r = (r * a) % 1000000007;
    a = (a * a) % 1000000007;
    b = b / 2;
  }
  return r;
}
long long D[1000], mult;
long long val(long long n, long long r, long long m, long long i) {
  if (r > n) return 0;
  if ((m - i - 1) / n + 1 > mult) return (D[r] * C[n][r]) % 1000000007;
  return D[r];
}
int main() {
  pre();
  long long m;
  int n, k;
  long long dp[101][10001];
  cin >> n >> m >> k;
  mult = (m - n) / n + 1;
  for (int r = 0; r <= n; r++) {
    D[r] = mypow(C[n][r], mult);
  }
  for (int j = 0; j <= k; j++) {
    dp[0][j] = val(n, j, m, 0);
  }
  for (int i = 1; i < n; i++) {
    for (int j = max(0, k - (n - 1 - i) * n - 1); j <= min(k, (i + 1) * n + 1);
         j++) {
      dp[i][j] = 0;
      for (int l = 0; l <= n; l++) {
        if (j - l < 0) break;
        dp[i][j] =
            (dp[i][j] + (val(n, l, m, i) * dp[i - 1][j - l]) % 1000000007) %
            1000000007;
      }
    }
  }
  cout << dp[n - 1][k] << endl;
  return 0;
}
