import java.util.*;

public class Main {
    static final int MOD = 1000000007;
	public static void main (String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int d = sc.nextInt();
		int k = sc.nextInt();
		int[][] dp = new int[n + 1][k + 2];
		dp[0][0] = 1;
		for (int i = 1; i <= n; i++) {
		    for (int j = 0; j < k; j++) {
		        dp[i][j + 1] += dp[i - 1][j];
		        dp[i][j + 1] %= MOD;
		        dp[i][Math.min(j + d + 1, k + 1)] += MOD - dp[i - 1][j];
		        dp[i][Math.min(j + d + 1, k + 1)] %= MOD;
		    }
		    for (int j = i; j <= k + 1; j++) {
		        dp[i][j] += dp[i][j - 1];
		        dp[i][j] %= MOD;
		    }
		}
		System.out.println(dp[n][k]);
	}
}