N,A,B,X,Y = list(map(int,input().split()))
H = list(map(int,input().split()))

H.sort(reverse = True)
count = 0
i = 0
while count < A and i < N:
    q = H[i] // X
    if q == 0:
        count += 1
        H[i] = 0
        i += 1
    else:
        q1 = min(A - count,q)
        count += q1
        H[i] -= X * q1
        i += 1
if count < A:
    H.sort(reverse = True)
    for i in range(min(A-count,N)):
        H[i] = 0
if sum(H) <= Y * B:
    print('yes')
else:
    print('no')