N,S,B=map(int,input().split())
H=list(map(int,input().split()))

dp=[-1 for _ in range(S+1)]
#道中でH_{i+1}に到達できない場合を知りたい
#NDP使えば通るっしょ()
dp[S]=H[0]
for i in range(N):
    ndp=[-1 for _ in range(S+1)]
    m=0
    for j in reversed(range(S+1)):
        if dp[j]==-1:continue
        m=max(m,dp[j])
        if j>0:dp[j-1]=max(dp[j]+B,dp[j-1])
        
        if i!=N-1:
            if dp[j]>H[i+1]:ndp[j]=max(dp[j],ndp[j])
    if m>=H[i]:dp[S]=max(dp[S],H[i])

    dp=(dp if i==N-1 else ndp[:])
print("Yes" if dp.count(-1)!=S+1 else "No")