from heapq import heappop, heapify, heappush
n, x, y, z = map(int, input().split())
A = list(int(-a) for a in map(int, input().split()))
heapify(A)

if n > x + y + z or -sum(A) >= x * 1000 + y * 5000 + z * 10000:
    print("No")
    exit()

while A:
    if not z:
        break
    a = -heappop(A)
    if a >= 10000:
        use = min(a//10000, z)
        z -= use
        a -= use * 10000
        heappush(A, -a)
    else:
        z = -1

while A:
    if not y:
        break
    a = -heappop(A)
    if a >= 5000:
        use = min(a//5000, y)
        y -= use
        a -= use * 5000
        heappush(A, -a)
    else:
        y = -1

while A:
    if not x:
        break
    a = -heappop(A)
    if a >= 1000:
        use = min(a//1000, x)
        x -= use
        a -= use * 1000
        heappush(A, -a)
    else:
        x = -1

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