#include <bits/stdc++.h>

using namespace std;

const int modi = 1'000'000'007;

int dp[112][10240], s[112][10240];

inline void inc(int & x, int v) {
    x += v;
    if (x >= modi) {
        x -= modi;
    }
}

int main() {
    int n, w, h;
    cin >> n >> w >> h;
    for (int i = 0; i <= n; i++) {
        dp[1][i] = min(h+1, i+1);
        if (i != 0) s[1][i] = s[1][i-1];
        inc(s[1][i], dp[1][i]);
    }
    for (int i = 2; i <= w; i++) {
        dp[i][0] = 1;
        for (int j = 1; j <= n; j++) {
            if (j <= h) {
                dp[i][j] = s[i-1][j];
            } else {
                dp[i][j] = s[i-1][j] - s[i-1][j-h-1];
                if (dp[i][j] < 0) dp[i][j] += modi;
            }
        }
        s[i][0] = dp[i][0];
        for (int j = 1; j <= n; j++) {
            s[i][j] = s[i][j-1];
            inc(s[i][j], dp[i][j]);
        }
    }
    cout << (dp[w][n] - (min(n/w, h+1) + 1) % modi + modi) % modi << endl;
}