import heapq n,a,b,x,y=map(int,input().split()) h=list(map(int,input().split())) c=[] for i in range(n): c.append(-h[i]) heapq.heapify(c) for i in range(a): target=heapq.heappop(c) target=min(0,x+target) heapq.heappush(c,target) for i in range(n): h[i]=-c[i] if sum(h)<=b*y: print("Yes") else: print("No")