n,a,b,x,y = map(int,input().split())
h = list(map(lambda x:-int(x),input().split()))
b_sum = b*y
h.sort(reverse=True)
import heapq
q = h[::]
heapq.heapify(q)
# print(q)
for i in range(a):
    aa = heapq.heappop(q)
    aa = min(aa+x,0)
    heapq.heappush(q,aa)
h = list(map(lambda x:-int(x),q))
# print(h)
for i in range(n):
    d = min(b_sum,h[i])
    h[i] -= d
    b_sum -= d
if sum(h) == 0:
    print("Yes")
else:
    print("No")