import heapq
from operator import itemgetter


def main() -> None:
    n, a, b, x, y = map(int, input().split())
    rem_b = y * b
    h = list(map(int, input().split()))
    que = [(-h[i], i) for i in range(n)]
    heapq.heapify(que)
    for _ in range(a):
        top, i = heapq.heappop(que)
        top += x
        heapq.heappush(que, (top, i))

    que.sort(key=itemgetter(1))

    for hi, _ in que:
        hi *= -1

        if hi >= 0:
            if hi > rem_b:
                print("No")
                return
            else:
                rem_b -= hi

    print("Yes")


if __name__ == "__main__":
    main()