import heapq

N,A,B,X,Y = map(int, input().split())
H = list(map(int, input().split()))
HQ = []
for i in range(N):
    heapq.heappush(HQ,(-H[i],i))
for _ in range(A):
    hi,i = heapq.heappop(HQ)
    H[i]-=X
    heapq.heappush(HQ,(-H[i],i))

for i in range(B):
    y = Y
    j = 0
    while y>0 and j<N:
        d = min(y,H[j])
        if d>0:
            H[j]-=d
            y-=d
        j+=1
if max(H)<=0:
    print('Yes')
else:
    print('No')