import sys

sys.setrecursionlimit(10 ** 6)
from bisect import *
from collections import *
from heapq import *

def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def SI(): return sys.stdin.readline()[:-1]
def LLI(rows_number): return [LI() for _ in range(rows_number)]
int1 = lambda x: int(x) - 1
def MI1(): return map(int1, sys.stdin.readline().split())
def LI1(): return list(map(int1, sys.stdin.readline().split()))
p2D = lambda x: print(*x, sep="\n")
dij = [(1, 0), (0, 1), (-1, 0), (0, -1)]

def main():
    n,*xyz=MI()
    aa=LI()
    mm=[10000,5000,1000]
    for m,x in zip(mm,xyz):
        n=len(aa)
        for i in range(n):
            c=min(aa[i]//m,x)
            aa[i]-=c*m
            x-=c
        aa.sort(reverse=True)
        while aa and aa[-1]==0:aa.pop()
        if len(aa)<=x:aa=[]
        else:aa=aa[x:]
    if aa:print("No")
    else:print("Yes")

main()