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

int dp[301][90001];
int main(){
    int n, d, k; cin >> n >> d >> k;
    dp[0][0] = 1;
    for(int i = 0; i < n; ++i){
        for(int j = 0; j < k; ++j){
            if(dp[i][j] == 0){ continue; }
            for(int step=1; step < d + 1; ++step){
                if(j + step < k + 1){
                    dp[i+1][j+step] += dp[i][j];
                    dp[i+1][j+step] %= MOD;
                }
            } 
        }
    }
    cout << dp[n][k] << endl;
    return 0;
}