from heapq import heappop as pop, heappush as push, heapify

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

hh = list(map(lambda x: -x, H))
heapify(hh)

for _ in range(A):
    h = -pop(hh)
    h -= X
    push(hh, -h)

sum_ = 0
for h in hh:
    sum_ += max(0, -h)

if sum_ <= Y*B:
    print("Yes")
else:
    print("No")