def solve2(n, a, b, x, y, h):
    import heapq
    hm = [-x for x in h]
    heapq.heapify(hm)
    for i in range(a):
        target = heapq.heappop(hm)
        target = min(0, x + target)
        heapq.heappush(hm, target)
    h = [-x for x in hm]
    if sum(h) <= b * y:
        return 'Yes'
    else:
        return 'No'


n, a, b, x, y = map(int,input().split())
h = list(map(int,input().split()))
print(solve2(n, a, b, x, y, h))