#include <bits/stdc++.h>
#pragma GCC optimize(2)
#pragma GCC optimize(3)
#pragma GCC optimize(4)
using namespace std;
const int MOD = 1e9 + 7;
const int N = 110;
long long dp[N][N * N];
long long qp[N][N][2];
long long q_pow(long long n, long long k) {
  long long ans = 1;
  while (k) {
    if (k & 1) ans = (ans * n) % MOD;
    n = (n * n) % MOD;
    k >>= 1;
  }
  return ans;
}
int main() {
  int n, k;
  long long m;
  scanf("%d %lld %d", &n, &m, &k);
  long long cnt = m / n;
  long long C = 1;
  for (int i = 0; i <= n; i++) {
    qp[n][i][0] = q_pow(C, cnt);
    qp[n][i][1] = q_pow(C, cnt + 1);
    C = (C * (n - i)) % MOD;
    C = (C * q_pow(i + 1, MOD - 2)) % MOD;
  }
  dp[0][0] = 1;
  for (int i = 1; i <= n; i++) {
    for (int j = 0; j <= k; j++) {
      for (int l = 0; l <= n && j >= l; l++) {
        if (i <= m % n)
          dp[i][j] = (dp[i][j] + dp[i - 1][j - l] * qp[n][l][1]) % MOD;
        else
          dp[i][j] = (dp[i][j] + dp[i - 1][j - l] * qp[n][l][0]) % MOD;
      }
    }
  }
  printf("%lld\n", dp[n][k]);
  return 0;
}
