n, a, b, x, y = map(int, input().split())
h = [int(i) for i in input().split()]
h.sort()

def magicA():
    for i in range(n):
        if h[n-i-1] > 0:
            h[n-i-1] -= x
            break
    h.sort()

def magicB():
    p = y
    i = 0
    while p > 0 and i < n:
        if h[i] > 0:
            d = min(p,h[i])
            h[i] -= d
            p -= d
        i += 1

def check():
    if max(h) <= 0:
        return True
    return False

def is_clear():
    if check():
        print("Yes")
    else:
        print("No")

while not(check()) and a > 0:
    magicA()
    a -= 1
while not(check()) and b > 0:
    magicB()
    b -= 1
is_clear()