#include <iostream>
#include <vector>

using namespace std;

using int64 = long long;

const int MOD = 1000000007;
int main() {
    int n,d,k;
    cin >> n >> d >> k;
    vector<vector<int64>> dp(n+1, vector<int64>(k+1, 0));
    dp[0][0] = 1;
    for (int i=0; i<n; i++) {
        for (int j=i; j<=(i*d)+d; j++) {
            for (int l=1; l<=d; l++) {
                if (j + l > k) continue;
                if (dp[i+1][j+l] >= MOD) dp[i+1][j+l] %= MOD;
                dp[i+1][j+l] += dp[i][j];
            }
        }
    }

    cout << dp[n][k] % MOD << endl;
}