import heapq


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

heap = []
for h in H:
    heapq.heappush(heap, -h)

while A > 0:
    d = -heapq.heappop(heap)
    if d < X:
        A -= 1
        d -= X
    else:
        A -= d // X
        d -= (d // X) * X
    heapq.heappush(heap, -d)

total = sum([-min(a, 0) for a in heap])

if total > Y*B:
    print("No")
else:
    print("Yes")