# import sys
# input = sys.stdin.readline
def mp():return map(int,input().split())
def lmp():return list(map(int,input().split()))
def mps(A):return [tuple(map(int, input().split())) for _ in range(A)]
import math
import bisect
import heapq
from copy import deepcopy as dc
from itertools import accumulate
from collections import Counter, defaultdict, deque
def ceil(U,V):return (U+V-1)//V
def modf1(N,MOD):return (N-1)%MOD+1
inf = int(1e20)
mod = int(1e9+7)
import time
import copy

n,a,b,x,y = mp()
h = lmp()
hq = [(-h[i],i) for i in range(n)]
heapq.heapify(hq)
while a != 0:
    here,num = heapq.heappop(hq)
    #print(here,num)
    heapq.heappush(hq, (here+x, num))
    a -= 1
hq.sort(key=lambda x:x[1])
hq = deque(hq)
while b != 0:
    now = y
    while now != 0 and hq:
        u = hq.popleft()
        if u[0] >= 0:continue
        if -now <= u[0]:
            now += u[0]
        else:
            hq.appendleft((u[0]+now,u[1]))
            now = 0
    b -= 1
    if b == 0 or not hq:
        break
#print(hq)
f = True
for i,j in hq:
    if i < 0:f = False
if f:print("Yes")
else:print("No")