# dpも考えたがどのように構築するのかわからず
# dpでなく貪欲法、10000円札の使い方を貪欲で決める、次に5000円札の使い方を貪欲で決める
# 10000円札があるとき、1万円以上の商品には1万円札を使ってよい、千・5千を組み合わせて使ってbetterなことはない
# 10000円札があるとき、最大価格の店で使ってよい、それ未満の店で使うメリットなし

N, X, Y, Z = map(int, input().split())
A = list(map(int, input().split()))
A_heap = [-(a+1) for a in A]
from heapq import *
heapify(A_heap)

#print(A_heap)


X_remainder = X
Y_remainder = Y
Z_remainder = Z

# 1万円札貪欲
while len(A_heap)>0 and Z_remainder > 0:
    mx = - heappop(A_heap)
    Z_use = min(Z_remainder, mx//10000)
    if Z_use > 0:
        Z_remainder -= Z_use
        if mx - Z_use*10000 > 0:
            heappush(A_heap, -(mx - Z_use*10000))
    elif Z_use == 0:
        Z_use = 1
        Z_remainder -= Z_use
        if mx - Z_use*10000 > 0:
            heappush(A_heap, -(mx - Z_use*10000))        
    
    if Z_remainder == 0:
        break
    
#print(A_heap, [X_remainder, Y_remainder, Z_remainder])

# 5千円札貪欲
while len(A_heap)>0 and  Y_remainder > 0:
    mx = - heappop(A_heap)
    Y_use = min(Y_remainder, mx//5000)
    if Y_use > 0:
        Y_remainder -= Y_use
        if mx - Y_use*5000 > 0:
            heappush(A_heap, -(mx - Y_use*5000))
    elif Y_use == 0:
        Y_use = 1
        Y_remainder -= Y_use
        if mx - Y_use*5000 > 0:
            heappush(A_heap, -(mx - Y_use*5000))        
    
    if Y_remainder == 0:
        break
    
#print(A_heap, [X_remainder, Y_remainder, Z_remainder])


# 1千円札貪欲
while len(A_heap)>0 and  X_remainder > 0:
    mx = - heappop(A_heap)
    X_use = min(X_remainder, mx//1000)
    if X_use > 0:
        X_remainder -= X_use
        if mx - X_use*1000 > 0:
            heappush(A_heap, -(mx - X_use*1000))
    elif X_use == 0:
        X_use = 1
        X_remainder -= X_use
        if mx - X_use*1000 > 0:
            heappush(A_heap, -(mx - X_use*1000))  
    
    if X_remainder == 0:
        break
    
#print(A_heap, [X_remainder, Y_remainder, Z_remainder])

if len(A_heap) == 0:
    print('Yes')
else:
    print('No')