#include <bits/stdc++.h>
using namespace std;
const int MOD = (int)1e9 + 7;
const int maxn = 105;
long long C[maxn][maxn], dp[maxn][maxn * maxn], f[maxn][2];
long long modExp(long long a, long long b) {
  long long t = 1;
  while (b) {
    if (b & 1) t = t * a % MOD;
    a = a * a % MOD;
    b >>= 1;
  }
  return t;
}
int main() {
  long long n, m, k;
  cin >> n >> m >> k;
  long long cnt = m / n;
  long long rem = m % n;
  C[0][0] = 1;
  for (int i = 1; i < maxn; i++) {
    C[i][0] = 1;
    for (int j = 1; j <= i; j++) {
      C[i][j] = (C[i - 1][j] + C[i - 1][j - 1]) % MOD;
    }
  }
  for (int i = 0; i <= n; i++) {
    f[i][0] = modExp(C[n][i], cnt);
    f[i][1] = modExp(C[n][i], cnt + 1);
  }
  dp[0][0] = 1;
  for (int i = 1; i <= n; i++) {
    for (int j = 0; j <= k; j++) {
      dp[i][j] = 0;
      for (int r = 0; r <= n; r++) {
        if (r > j) break;
        dp[i][j] += f[r][(i <= rem)] * dp[i - 1][j - r] % MOD;
        dp[i][j] %= MOD;
      }
    }
  }
  cout << dp[n][k] << endl;
  return 0;
}
