#include <bits/stdc++.h>
using namespace std;
long long m, k, cnk[200][200][2], f[200][200 * 200], mod = 1000000007;
int n;
long long bin_pow_mod(long long a, long long b, long long m) {
  long long answer = 1;
  for (; b; b /= 2) {
    if (b % 2) {
      answer = (answer * a) % m;
      b--;
    };
    a = (a * a) % m;
  };
  return answer;
};
int main() {
  cin >> n >> m >> k;
  cnk[0][0][0] = 1;
  for (int i = 1; i <= n; i++) {
    cnk[i][0][0] = 1;
    for (int j = 1; j <= i; j++)
      cnk[i][j][0] = (cnk[i - 1][j][0] + cnk[i - 1][j - 1][0]) % mod;
  };
  for (int i = 0; i <= n; i++)
    for (int j = 0; j <= i; j++) {
      cnk[i][j][1] = bin_pow_mod(cnk[i][j][0], m / n + 1, mod);
      cnk[i][j][0] = bin_pow_mod(cnk[i][j][0], (m - n) / n + 1, mod);
    };
  f[0][0] = 1;
  for (int i = 1; i <= n; i++)
    for (int j = 0; j <= k; j++)
      if (i > m % n) {
        for (int l = 0; l <= min(n, j); l++)
          f[i][j] = (f[i][j] + f[i - 1][j - l] * cnk[n][l][0]) % mod;
      } else
        for (int l = 0; l <= min(n, j); l++)
          f[i][j] = (f[i][j] + f[i - 1][j - l] * cnk[n][l][1]) % mod;
  cout << f[n][k] << endl;
  return 0;
}
