#include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
int n, k;
long long m, arr[111][111], rar[111][111], dp[111][11111];
long long mode(long long a, long long b) {
  long long ans = 1;
  while (b) {
    if (b & 1) ans = ans * a % mod;
    a = a * a % mod;
    b >>= 1;
  }
  return ans;
}
int main() {
  cin >> n >> m >> k;
  arr[0][0] = 1;
  for (int i = 1; i <= n; i++) {
    arr[i][0] = arr[i][i] = 1;
    for (int j = 1; j < i; j++)
      arr[i][j] = (arr[i - 1][j - 1] + arr[i - 1][j]) % mod;
  }
  for (int i = 1; i <= n; i++)
    for (int j = 0; j <= n; j++) rar[i][j] = mode(arr[n][j], (m - i + n) / n);
  dp[0][0] = 1;
  for (int i = 1; i <= n; i++)
    for (int j = 0; j <= i * n; j++)
      for (int k = max(j - n, 0); k <= j; k++)
        dp[i][j] = (dp[i][j] + dp[i - 1][k] * rar[i][j - k] % mod) % mod;
  cout << dp[n][k];
  return 0;
}
