from heapq import *

N, X, Y, Z = map(int, input().split())
A = list(map(int, input().split()))
A = list(map(lambda x : -x, A))
heapify(A)
while Z and A:
    v = -heappop(A)
    if v >= 10000:
        n = min(Z, v // 10000)
        Z -= n
        v -= 10000 * n
        heappush(A, -v)
    else:
        Z -= 1

while Y and A:
    v = -heappop(A)
    if v >= 5000:
        n = min(Y, v // 5000)
        Y -= n
        v -= 5000 * n
        heappush(A, -v)
    else:
        Y -= 1

while X and A:
    v = -heappop(A)
    if v >= 1000:
        n = min(X, v // 1000)
        X -= n
        v -= 1000 * n
        heappush(A, -v)
    else:
        X -= 1

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