#!usr/bin/env python3
from collections import defaultdict, deque
from heapq import heappush, heappop
from itertools import permutations, accumulate
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def IR(n):
    return [I() for _ in range(n)]
def LIR(n):
    return [LI() for _ in range(n)]

sys.setrecursionlimit(1000000)
mod = 1000000007

def main():
    n,a,b,x,y = LI()
    h = LI()
    q = []
    for i in h:
        heappush(q,-i)
    for _ in range(a):
        if not q:
            break
        i = heappop(q)
        i += x
        if i < 0:
            heappush(q,i)
    s = -sum(q)
    if s <= b*y:
        print("Yes")
    else:
        print("No")
    return


if __name__ == "__main__":
    main()