n, a, b, x, y = map(int, input().split())
H = list(map(int, input().split()))

for i in range(n):
    q, r = divmod(H[i], x)
    if a >= q:
        H[i] = r
        a -= q
    else:
        H[i] -= a * x
        a = 0
    if a == 0:
        break

if a > 0:
    Hc = [(H[i], i) for i in range(n)]
    Hc.sort(key=lambda x: x[0], reverse=True)
    for i in range(n):
        ind = Hc[i][1]
        if H[ind] > 0:
            a -= 1
            H[ind] = 0
        if a == 0:
            break

if b > 0:
    cy = y
    for i in range(n):
        if H[i] > cy:
            H[i] -= cy
            b -= 1
            if b == 0:
                break
            q, r = divmod(H[i], y)
            b -= q
            if b <= 0:
                break
            H[i] = 0
            cy = y - r
        else:
            cy -= H[i]
            H[i] = 0
            if cy == 0:
                b -= 1
                cy = y

if sum(H) == 0:
    print("Yes")
else:
    print("No")