from heapq import heappush, heappop, heapify


def solve():
    q = [-h for h in H]
    heapify(q)
    for _ in range(A):
        if len(q) == 0: break
        x = -heappop(q)
        if x > X:
            heappush(q, -(x-X))

    tot = sum(-x for x in q)
    return tot <= Y * B


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

if solve():
    print('Yes')
else:
    print('No')