import heapq

N,A,B,X,Y = map(int,input().split())
H = list(map(int,input().split()))

a = 0
H.sort(reverse=True)
hq = H.copy()

while a<A:
    h = heapq.heappop(hq)
    h-=X
    heapq.heappush(hq,h)
    a+=1

hq = list(map(lambda x:0 if x<=0 else x,list(hq)))
print('Yes'if sum(hq)<=B*Y else 'No')