#include <bits/stdc++.h>
using namespace std;

const long long MOD = 1000000007;
long long dp[101][20001];


int main(){
	long long N, S ,K;
	scanf("%lld",&N);
	scanf("%lld",&S);
	scanf("%lld",&K);

	dp[0][0] = 1;

	for (int i = 1; i <= 100; i++) {
		for (int j = 0; j <= 20000; j++) {
			if (j - i >= 0) {
				dp[i][j] = (dp[i - 1][j] + dp[i][j - i]) % MOD;
			} else {
				dp[i][j] = dp[i - 1][j];
			}
		}
	}

	if (S-(N-1)*N*K/2 >= 0) printf("%lld\n", dp[N][S-(N-1)*N*K/2]); else printf("0\n");
	return 0;
}