n,d,k=map(int,input().split())
dsum=[[0 for i in range(n*d+1)] for j in range(n+1)]
dsum[0][0]=1
MOD=10**9+7
for i in range(1,n+1):
    for j in range(1,n*d+1):
        if j<=d:
            dsum[i][j]=dsum[i-1][j-1]+dsum[i][j-1]
            dsum[i][j]%=MOD
        else:
            dsum[i][j]=dsum[i-1][j-1]-dsum[i-1][j-d-1]+dsum[i][j-1]
            dsum[i][j]%=MOD
print(dsum[n][k])