n,d,k=map(int,input().split())
dp=[0]*(n*d+1)
dp[0]=1
for i in range(1,n*d+1):
    for j in range(max(0,i-d),i-1):
        dp[i]+=dp[j]
print(dp[k])