# dpのように見えるが貪欲法、札降順で決めていく
# ぴったり金額では足らないのでa+1しておく
# すべての1万以上の商品に、1万未満となるまで、1万円札を使う、余れば商品価格降順で使い切る
# 次に5千円札、1千円札

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

A1 = [a+1 for a in A]
# use 10000
Z_remainder = Z
for i in range(N):
    if A1[i] >= 10000:
        howmany = A1[i]//10000
        use = min(howmany, Z_remainder)
        Z_remainder -= use
        A1[i] = max(0, A1[i]-use*10000)
A1.sort(reverse = True)
for i in range(Z_remainder):
    # Z_remainderが1以上なら、残る商品は10000円未満のはず
    A1[i] = max(0, A1[i]-10000)
    Z_remainder -= 1
    
#print(A1, Z_remainder)

# use 5000
Y_remainder = Y
for i in range(N):
    if A1[i] >= 5000:
        howmany = A1[i]//5000
        use = min(howmany, Y_remainder)
        Y_remainder -= use
        A1[i] = max(0, A1[i]-use*5000)
A1.sort(reverse = True)
for i in range(Y_remainder):
    A1[i] = max(0, A1[i]-5000)
    Y_remainder -= 1
    
#print(A1, Y_remainder)

# use 1000
X_remainder = X
for i in range(N):
    if A1[i] >= 1000:
        # 1000のときは繰り上げで使う必要あるだろう
        howmany = (A1[i]+999)//1000
        use = min(howmany, X_remainder)
        X_remainder -= use
        A1[i] = max(0, A1[i]-use*1000)
A1.sort(reverse = True)
for i in range(X_remainder):
    A1[i] = max(0, A1[i]-1000)
    X_remainder -= 1
    
#print(A1, X_remainder)

if sum(A1) == 0:
    print('Yes')
else:
    print('No')