#include <bits/stdc++.h>
using namespace std;
const int mod = 1000000000 + 7;
const int maxn = 100 + 5;
long long w;
int h, m;
int mpow(int b, long long e) {
  if (e == 0)
    return 1;
  else if (e % 2 == 0) {
    int first = mpow(b, e / 2);
    return (first * (long long)first) % mod;
  } else {
    return (b * (long long)mpow(b, e - 1)) % mod;
  }
}
int c[maxn][maxn];
int prec[maxn][maxn];
int dp[maxn][maxn * maxn];
int main() {
  c[0][0] = 1;
  for (int i = 1; i < maxn; ++i) {
    for (int j = 0; j <= i; ++j) {
      c[i][j] = c[i - 1][j];
      if (j) c[i][j] += c[i - 1][j - 1];
      if (c[i][j] >= mod) c[i][j] -= mod;
    }
  }
  cin >> h >> w >> m;
  for (int k = 0; k <= h; ++k)
    for (int col = 0; col <= h; ++col)
      prec[col][k] = mpow(c[h][k], w / h + (col <= (w % h)));
  dp[0][0] = 1;
  for (int col = 1; col <= h; ++col) {
    for (int sum = 0; sum <= m; ++sum)
      for (int k = 0; k <= min(sum, h); ++k)
        dp[col][sum] =
            (dp[col][sum] + dp[col - 1][sum - k] * (long long)prec[col][k]) %
            mod;
  }
  printf("%d\n", dp[h][m]);
  return 0;
}
