#include <bits/stdc++.h>
using namespace std;
long long int n, m, k;
long long int fact[101];
long long int inv_fact[101];
long long int dp[101][10001];
long long int ncr1[101][101];
long long int pre_com[101][101];
long long int powr(long long int a, long long int b) {
  if (b == 0) return 1;
  long long int temp = powr(a, b / 2);
  temp = (temp * temp) % 1000000007;
  if (b % 2) temp = (temp * a) % 1000000007;
  return temp;
}
long long int ncr(long long int a, long long int b) {
  if (ncr1[a][b] != -1) return ncr1[a][b];
  long long int ans;
  ans = ((fact[a] * inv_fact[b]) % 1000000007) * inv_fact[a - b];
  ans %= 1000000007;
  ncr1[a][b] = ans;
  return ans;
}
long long int com(long long int a, long long int b) {
  if (a == n) {
    if (b == 0)
      return 1;
    else
      return 0;
  }
  if (dp[a][b] != -1) return dp[a][b];
  long long int ans = 0;
  for (long long int i = 0; i <= min(n, b); i++) {
    long long int temp;
    temp = pre_com[a][i];
    ans += temp * com(a + 1, b - i);
    ans %= 1000000007;
  }
  dp[a][b] = ans;
  return ans;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  ;
  fact[0] = 1;
  for (long long int i = 1; i <= 100; i++) {
    fact[i] = (fact[i - 1] * i) % 1000000007;
  }
  for (int i = 0; i <= 100; i++) {
    inv_fact[i] = powr(fact[i], 1000000007 - 2);
  }
  memset(ncr1, -1, sizeof(ncr1));
  cin >> n >> m >> k;
  memset(dp, -1, sizeof(dp));
  for (int i = 0; i <= 100; i++) {
    for (int j = 0; j <= 100; j++) {
      pre_com[i][j] = powr(ncr(n, j), (m - i + n - 1) / (n));
    }
  }
  cout << com(0, k) << "\n";
}
