#include <bits/stdc++.h>
using namespace std;
int n, k;
long long m, x[111], c[111][111], a[111][111], b[111 * 111], d[111 * 111];
long long expmod(long long a, long long b) {
  b %= (1000000007 - 1);
  long long rlt = 1, x = a;
  while (b) {
    if (b & 1) rlt = rlt * x % 1000000007;
    x = x * x % 1000000007, b >>= 1;
  }
  return rlt;
}
int main() {
  cin >> n >> m >> k;
  c[0][0] = 1;
  for (int i = 1; i <= n; i++) {
    c[i][0] = 1;
    for (int j = 1; j <= i; j++)
      c[i][j] = (c[i - 1][j] + c[i - 1][j - 1]) % 1000000007;
  }
  for (int i = 1; i <= n; i++) {
    x[i] = m / n;
    if (m % n >= i) x[i]++;
  }
  for (int i = 1; i <= n; i++) {
    for (int j = 0; j <= n; j++) a[i][j] = expmod(c[n][j], x[i]);
  }
  for (int j = 0; j <= n; j++) b[j] = a[1][j];
  for (int i = 2; i <= n; i++) {
    for (int j = 0; j <= n * n; j++) d[j] = 0;
    for (int j = 0; j <= n * n; j++) {
      for (int k = 0; k <= n; k++)
        if (j + k <= n * n) {
          d[j + k] = (d[j + k] + b[j] * a[i][k]) % 1000000007;
        }
    }
    for (int j = 0; j <= n * n; j++) b[j] = d[j];
  }
  cout << b[k] << endl;
  return 0;
}
