#include <bits/stdc++.h>
using namespace std;
long long int dp[101][10005];
long long int com[101][101];
long long int r, c, k;
int sz;
void getCom() {
  for (int i = 0; i < 101; i++) com[i][0] = 1;
  for (int i = 1; i < 101; i++)
    for (int j = 1; j < i + 1; j++)
      com[i][j] = (com[i - 1][j] + com[i - 1][j - 1]) % 1000000007;
}
long long int getMod(long long int div, long long int rep) {
  if (rep == 0) {
    return 1;
  }
  if (rep & 1)
    return (div * getMod(div, rep - 1)) % 1000000007;
  else {
    long long int tmp = getMod(div, rep >> 1);
    return (tmp * tmp) % 1000000007;
  }
}
int main() {
  getCom();
  cin >> r >> c >> k;
  dp[0][0] = 1;
  for (int i = 1; i < r + 1; i++) {
    int Lm = min(k, (i - 1) * r);
    long long int rep = (c - i) / r;
    for (int j = 0; j < r + 1; j++)
      if (j <= k) {
        long long int mul = com[r][j] * getMod(com[r][j], rep);
        mul = mul % 1000000007;
        for (int l = 0; l < Lm + 1; l++)
          if (j + l <= k)
            dp[i][j + l] = (dp[i][j + l] + dp[i - 1][l] * mul) % 1000000007;
      }
  }
  long long int ans = 0;
  cout << dp[r][k] << endl;
  return 0;
}
