#include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
int dp[2][100 * 100 + 2];
int c[102][102];
int kmod(long long x, long long k) {
  long long base = 1;
  while (k) {
    if (k & 1) base = base * x % mod;
    x = x * x % mod;
    k >>= 1;
  }
  return (int)base;
}
int main() {
  ios::sync_with_stdio(false);
  int n, K;
  long long m;
  cin >> n >> m >> K;
  for (int i = 1; i <= n; ++i) {
    c[i][i] = c[i][0] = 1;
    for (int j = 1; j < i; ++j) {
      c[i][j] = c[i - 1][j] + c[i - 1][j - 1];
      if (c[i][j] >= mod) c[i][j] -= mod;
    }
  }
  int t = 0;
  dp[0][0] = 1;
  for (int i = 1; i <= n; ++i) {
    t ^= 1;
    memset(dp[t], 0, sizeof(dp[t]));
    for (int j = 0; j <= n; ++j) {
      int tmp = kmod(c[n][j], (m - i) / n + 1);
      for (int k = j; k <= (i - 1) * n + j && k <= K; ++k) {
        dp[t][k] = (dp[t][k] + dp[1 ^ t][k - j] * 1LL * tmp) % mod;
      }
    }
  }
  cout << dp[t][K] << endl;
  return 0;
}
