def aa(v,x):
    global n
    for i in range(n):
        c=min(x,a[i]//v)
        x-=c
        a[i]-=v*c
    a.sort(reverse=True)
    for i in range(n):
        if x:
            a[i]=0;x-=1

n,x,y,z=map(int,input().split())
a=list(map(lambda x:int(x)+1,input().split()))
aa(10000,z);aa(5000,y);aa(1000,x)
print("No" if max(a) else "Yes")