def main():
    from math import sqrt,sin,cos,tan,ceil,radians,floor,gcd,exp,log,log10,log2,factorial,fsum
    from heapq import heapify, heappop, heappush
    from bisect import bisect_left, bisect_right
    from copy import deepcopy
    import copy
    import random
    from collections import deque,Counter,defaultdict
    from itertools import permutations,combinations
    from decimal import Decimal,ROUND_HALF_UP
    #tmp = Decimal(mid).quantize(Decimal('0'), rounding=ROUND_HALF_UP)
    from functools import lru_cache, reduce
    #@lru_cache(maxsize=None)
    from operator import add,sub,mul,xor,and_,or_,itemgetter
    INF = 10**18
    mod1 = 10**9+7
    mod2 = 998244353
    
    #DecimalならPython
    
    
    '''
    
    
    
    '''
    
    N,X,Y,Z = map(int, input().split())
    A = list(map(int, input().split()))
    
    A.sort(reverse=True)
    
    for i in range(N):
        if A[i] > 10000 and X > 0:
            cnt = A[i]//10000
            A[i] -= min(cnt, X)*10000
            X -= min(cnt,X)
    
    if X >= N:
        print('Yes')
        exit()
    A.sort(reverse=True)
    A = A[X:]
    N = len(A)
    
    for i in range(N):
        if A[i] > 5000 and Y > 0:
            cnt = A[i]//5000
            A[i] -= min(cnt, Y)*5000
            Y -= min(cnt,Y)
    
    if Y >= N:
        print('Yes')
        exit()
    A.sort(reverse=True)
    A = A[Y:]
    N = len(A)
    
    for i in range(N):
        if A[i] > 1000 and Z > 0:
            cnt = A[i]//1000
            A[i] -= min(cnt, Z)*1000
            Z -= min(cnt,Z)
    
    if Z >= N:
        print('Yes')
    else:
        print('No')
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
if __name__ == '__main__':
    main()