import heapq
N,A,B,X,Y = map(int,input().split())
H = list(map(int,input().split()))
heap = []
for i in range(N):
    heapq.heappush(heap,-H[i])
cnt = 0
while heap and cnt<A:
    h = -heapq.heappop(heap)
    h -= X
    cnt += 1
    if h>0:
        heapq.heappush(heap,-h)
for _ in range(B):
    p = Y
    A = []
    while p>0 and heap:
        h = -heapq.heappop(heap)
        d = min(h,p)
        h -= d
        p -= d
        if h>0:
            A.append(h)
    for a in A:
        heapq.heappush(heap,-a)
if heap:
    print("No")
else:
    print("Yes")