#include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
const long long INF = 1e18;
const int N = 112;
const int mod = 1e9 + 7;
int n;
long long m;
int k;
int C[N][N];
int a[N][N];
int dp[N][N * N];
void init() {
  memset(C, 0, sizeof(C));
  C[0][0] = 1;
  for (int i = 1; i < N; ++i) {
    C[i][0] = 1;
    for (int j = 1; j < N; ++j) {
      C[i][j] = C[i - 1][j] + C[i - 1][j - 1];
      if (C[i][j] >= mod) C[i][j] -= mod;
    }
  }
}
int mypow(int x, long long k) {
  int a = 1;
  while (k) {
    if (k & 1) a = 1LL * a * x % mod;
    x = 1LL * x * x % mod;
    k >>= 1;
  }
  return a;
}
int main() {
  init();
  while (cin >> n >> m >> k) {
    int i, j, o;
    for (i = 1; i <= n; ++i) {
      for (j = 0; j <= n; ++j) {
        a[i][j] = mypow(C[n][j], m / n + (m / n * n + i <= m));
      }
    }
    memset(dp, 0, sizeof(dp));
    dp[0][0] = 1;
    for (i = 1; i <= n; ++i) {
      for (j = 0; j <= k; ++j) {
        for (o = 0; o <= n; ++o) {
          if (j - o < 0) continue;
          dp[i][j] += 1LL * dp[i - 1][j - o] * a[i][o] % mod;
          if (dp[i][j] >= mod) dp[i][j] -= mod;
        }
      }
    }
    printf("%d\n", dp[n][k]);
  }
}
