def main():
    import sys
    input = sys.stdin.read().split()
    idx = 0
    N = int(input[idx]); idx +=1
    A = int(input[idx]); idx +=1
    B = int(input[idx]); idx +=1
    X = int(input[idx]); idx +=1
    Y = int(input[idx]); idx +=1
    H = list(map(int, input[idx:idx+N]))
    
    for i in range(N+1):
        # Calculate sum of A's needed for first i monsters
        sum_a = 0
        for j in range(i):
            sum_a += (H[j] + X - 1) // X
            if sum_a > A:
                break
        if sum_a > A:
            continue
        
        # Check remaining monsters
        remaining = H[i:]
        k = 0
        start = 0
        h = remaining.copy()
        possible = True
        while True:
            # Find the first alive monster from start
            while start < len(h) and h[start] <= 0:
                start += 1
            if start >= len(h):
                break
            k += 1
            if k > B:
                possible = False
                break
            P = Y
            current = start
            while current < len(h) and P > 0:
                if h[current] <= 0:
                    current += 1
                    continue
                d = min(P, h[current])
                h[current] -= d
                P -= d
                if h[current] == 0:
                    current += 1
            start = current
        
        if possible and k <= B:
            print("Yes")
            return
    
    print("No")

if __name__ == "__main__":
    main()