#include using namespace std; using mint=atcoder::modint1000000007; int main(){ int n,k,d; cin>>n>>k>>d; vector dp(d+1); dp[0]=1; while(n--){ vector nxt(d+1),sumv(d+2); for(int j=0;j<=d;j++){ sumv[j+1]=sumv[j]+dp[j]; nxt[j]=sumv[j]-sumv[max(0,j-k)]; } dp=nxt; } cout<