import heapq
N,X,Y,Z = list(map(int,input().split()))
A = list(map(lambda x:-int(x),input().split()))
heapq.heapify(A)

while(Z > 0 and A):
    a = heapq.heappop(A);a *= -1
    
    use = min(Z, a//10000) if a >= 10000 else 1
    Z -= use
    if(a - use*10000 >= 0):heapq.heappush(A, -(a-use*10000))

while(Y > 0 and A):
    a = heapq.heappop(A);a *= -1
    
    use = min(Y, a//5000) if a >= 5000 else 1
    Y -= use
    if(a - use*5000 >= 0):heapq.heappush(A, -(a-use*5000))

while(X > 0 and A):
    a = heapq.heappop(A);a *= -1
    
    use = min(X, a//1000) if a >= 1000 else 1
    X -= use
    if(a - use*1000 >= 0):heapq.heappush(A, -(a-use*1000))

print("Yes" if not A else "No")