import heapq as hq
N, A, B, X, Y = map(int, input().split())
H = list(map(int, input().split()))
S = sum(H)
task = [-h for h in H]
task.sort()
for _ in range(A):
    v = -hq.heappop(task)
    if v >= X:
        S -= X
        v -= X
    else:
        S -= v
        v = 0
    hq.heappush(task, -v)

print('Yes' if S <= B*Y else 'No')