#define _CRT_SECURE_NO_WARNINGS
#include <cstdio>
#include <iostream>
#include <stack>
#include <queue>
#include <algorithm>
#include <functional>
#include <set>
#include <map>
#include <string>
#include <vector>
#include <cmath>
#include<sstream>
#include<list>
#include<iomanip>
#include <cstdlib>
#include <cstring>
#include <stack>
#include <bitset>
#include <cassert>
#include <stdlib.h>
#include <stdio.h>
using namespace std;
const int INF = 100000000;
const long long LINF = 3e18 + 7;
const int MAX_N = 6000010;
const int MAX_W = 10002;
const int MAX_ARRAYK = 100000;
double PI = 3.14159265358979323846;
//using ll = long long;


int N;
int S, K;
long long dp[110][20010];
long long mod = 1000000007;

int main() {

	cin >> N >> S >> K;

	for (int i = 0; i <= S; i += N) {
		dp[0][i] = 1;
	}

	for (int i = 1; i < N; i++) {
		for (int j = 0; j <= S; j++) {

			if (j - K * (N - i) >= 0) {
				dp[i][j] += dp[i - 1][j - K * (N - i)];
			}

			dp[i][j] %= mod;

			if (j - (N - i) >= 0) {
				dp[i][j] += dp[i][j - (N - i)];
			}
			dp[i][j] %= mod;
		}
	}
	
	cout << dp[N - 1][S] << endl;

	return 0;
}