#include <iostream>
#include <vector>
#include <functional>

using namespace std;

int main() {
    int n, w, h;
    cin >> n >> w >> h;

    long long mod = 1e9 + 7;

    vector<vector<long long>> dp(w + 1, vector<long long>(n + 1, -1));

    function<long long(int, int)> solve = [&](int idx, int rem) {
        if (idx == w) {
            return 1LL;
        }
        if (dp[idx][rem] != -1) {
            return dp[idx][rem];
        }

        long long ans = 0;
        for (int cur = 0; cur <= min(h, rem); ++cur) {
            ans = (ans + solve(idx + 1, rem - cur)) % mod;
        }

        return dp[idx][rem] = ans;
    };

    long long total_scenes = solve(0, n);

    long long plain_scenes = 0;
    for (int i = 0; i <= h; ++i) {
        if (1LL * i * w <= n) {
            plain_scenes++;
        }
    }

    long long mountain_scenes = (total_scenes - plain_scenes + mod) % mod;

    cout << mountain_scenes << endl;

    return 0;
}