#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
const int MOD = (int)1e9 + 7;

int main() {
    int n, s, k; cin >> n >> s >> k;
    s -= k * (n - 1) * n / 2;
    if (s < 0) {
        cout << 0 << endl;
        return 0;
    }
    vector<int> dp(s + 1);
    dp[0] = 1;
    for (int i = 0; i < n; i++) {
        for (int j = s; j >= 0; j--) {
            for (int x = 1; j + x * (n - i) <= s; x++) {
                (dp[j + x * (n - i)] += dp[j]) %= MOD;
            }
        }
    }
    cout << dp[s] << endl;
    return 0;
}