from heapq import heapify, heappush, heappop
n, a, b, x, y = map(int, input().split())
h = list(map(lambda x:-int(x), input().split()))
heapify(h)
for i in range(a):
    xx = -heappop(h)
    xx -= x
    heappush(h, -xx)
h = list(map(lambda x:-x, h))
t = b * y
for i in range(n):
    d = max(0, min(h[i], t))
    h[i] -= d
    t -= d
for i in range(n):
    if h[i] > 0:
        print('No')
        break
else:
    print('Yes')