#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using Graph = vector<vector<int>>;
using vi = vector<int>;
using vl = vector<long>;
using vll = vector<long long>;
using vvi = vector<vi>;
using vvl = vector<vl>;
using vvll = vector<vll>;
using vs = vector<string>;
using vc = vector<char>;
using vvc = vector<vc>;
using pll = pair<long long, long long>;
using vpll = vector<pll>;
const long double EPS = 1e-18;
const long long INF = 1e18;
const long double PI = acos(-1.0L);
#define reps(i, a, n) for (ll i = (a); i < (ll)(n); i++)
#define rep(i, n) for (ll i = (0); i < (ll)(n); i++)
#define rrep(i, n) for (ll i = (1); i < (ll)(n + 1); i++)
#define repd(i, n) for (ll i = n - 1; i >= 0; i--)
#define rrepd(i, n) for (ll i = n; i >= 1; i--)
#define ALL(n) begin(n), end(n)
#define IN(a, x, b) (a <= x && x < b)
#define INIT                          \
    std::ios::sync_with_stdio(false); \
    std::cin.tie(0);
template <class T>
inline T CHMAX(T& a, const T b) {
    return a = (a < b) ? b : a;
}
template <class T>
inline T CHMIN(T& a, const T b) {
    return a = (a > b) ? b : a;
}

int main() {
    ll N, S, K;
    cin >> N >> S >> K;
    S -= ((N - 1) * N * K / 2);
    if (S < 0) {
        cout << 0 << endl;
    } else {
        vvll dp(N + 1, vll(S + 1, 0));
        dp.at(0).at(0) = 1;
        rrep(i, N) {
            rep(j, S + 1) {
                if (j - i >= 0) {
                    dp.at(i).at(j) =
                        (dp.at(i - 1).at(j) + dp.at(i).at(j - i)) % 1000000007;
                } else {
                    dp.at(i).at(j) = dp.at(i - 1).at(j);
                }
            }
        }
        cout << dp.at(N).at(S) << endl;
    }
}