import sys

def solve():
    N, A, B, X, Y = map(int, sys.stdin.readline().split())
    H = list(map(int, sys.stdin.readline().split()))
    
    for k in range(N+1):
        sum_a = 0
        valid = True
        for i in range(k):
            need = (H[i] + X - 1) // X
            sum_a += need
            if sum_a > A:
                valid = False
                break
        if not valid:
            continue
        
        required_b = 0
        current = 0  # Remaining damage from previous B
        for i in range(k, N):
            h = H[i]
            if current >= h:
                current -= h
                continue
            else:
                h -= current
                current = 0
                full = h // Y
                rem = h % Y
                required_b += full
                if rem > 0:
                    required_b += 1
                    current = Y - rem
                else:
                    current = 0
        if required_b <= B:
            print("Yes")
            return
    print("No")

solve()