# 1万円以上の買い物には1万円札を価格以下まで使う
# それでも1万円が余っていれば、最高額のものに1万円を使う
# 5千円札も同様
# 残りを千円札でカバーできるか
# 最初にすべての価格を1円プラスしておく

N, X, Y, Z = map(int, input().split())
A = list(map(int, input().split()))
A = [a+1 for a in A]

X_remainder = X
Y_remainder = Y
Z_remainder = Z
A.sort(reverse = True)
for i in range(N):
    if A[i] >= 10000 and Z_remainder > 0:
        Z_use = min(Z_remainder, A[i]//10000)
        A[i] -= Z_use*10000
        Z_remainder -= Z_use
if Z_remainder > 0:
    A.sort(reverse = True)
    for i in range(N):
        if A[i] > 0 and Z_remainder > 0:
            Z_use = min(Z_remainder, (A[i]+9999)//10000)
            A[i] = max(0, A[i]-Z_use*10000)
            Z_remainder -= Z_use            
    
A.sort(reverse = True)
for i in range(N):
    if A[i] >= 5000 and Y_remainder > 0:
        Y_use = min(Y_remainder, A[i]//5000)
        A[i] -= Y_use*5000
        Y_remainder -= Y_use
if Y_remainder > 0:
    A.sort(reverse = True)
    for i in range(N):
        if A[i] > 0 and Y_remainder > 0:
            Y_use = min(Y_remainder, (A[i]+4999)//5000)
            A[i] = max(0, A[i]-Y_use*5000)
            Y_remainder -= Y_use            
    
A.sort(reverse = True)
for i in range(N):
    if X_remainder > 0:
        X_use = min(X_remainder, A[i]//1000)
        A[i] -= X_use*1000
        X_remainder -= X_use
if X_remainder > 0:
    A.sort(reverse = True)
    for i in range(N):
        if A[i] > 0 and X_remainder > 0:
            X_use = min(X_remainder, (A[i]+999)//1000)
            A[i] = max(0, A[i]-X_use*1000)
            X_remainder -= X_use    
            
if sum(A) == 0:
    print('Yes')
else:
    print('No')