from heapq import heapify, heappush, heappop
import sys
def main():
    input = sys.stdin.readline
    N, X, Y, Z = map(int, input().split())
    *A, = map(lambda x: -int(x), input().split())
    heapify(A)
    cnt = [Z, Y, X]
    for c, n in enumerate([10000, 5000, 1000]):
        while A and cnt[c] > 0:
            p = -heappop(A)
            d, m = divmod(p + 1, n)
            if d == 0 or (d == 1 and m == 0):
                cnt[c] -= 1
                continue
            if m == 0: d -= 1
            d = min(d, cnt[c])
            heappush(A, n * d - p)
            cnt[c] -= d
    print('No' if A else 'Yes')

if __name__ == '__main__':
    main()