#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
#define mod 998244353
int main(){
    cin.tie(0)->sync_with_stdio(0);
    cout.tie(0);
    ll N,S,K;
    cin>>N>>S>>K;
    ll dp[109][20009];
    for(int i=0;i<=N;i++){
        for(int j=0;j<=S;j++) dp[i][j]=0;
    }
    for(int i=(N-1)*K*N/2;i<=S;i+=N) dp[1][i]=1;
    for(int i=2;i<=N;i++){
        for(int j=0;j<=S;j++){
            if(j-(N-i+1)>=0) dp[i][j]=dp[i-1][j]+dp[i][j-(N-i+1)];
            else dp[i][j]=dp[i-1][j];
            dp[i][j]%=1000000007;
        }
    }
    cout<<dp[N][S]<<"\n";
}