import heapq
n,a,b,x,y=map(int,input().split())
h=list(map(int,input().split()))
if 1<=n<=3000 and 0<=a<=3000 and 0<=b<=3000 and 1<=x<=10**9 and 1<=y<=10**9 and min(h)>=1 and max(h)<=10**9:
  pass
else:
  raise Exception
hq=[]
for i in h:
  heapq.heappush(hq,-i)
for i in range(a):
  t=heapq.heappop(hq)
  heapq.heappush(hq,min(0,t+x))
if -sum(hq)<=b*y:
  print('Yes')
else:
  print('No')