import sys from heapq import heappush, heappop, heapify def input(): return sys.stdin.readline().strip() def list2d(a, b, c): return [[c] * b for i in range(a)] def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)] def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)] def ceil(x, y=1): return int(-(-x // y)) def INT(): return int(input()) def MAP(): return map(int, input().split()) def LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)] def Yes(): print('Yes') def No(): print('No') def YES(): print('YES') def NO(): print('NO') sys.setrecursionlimit(10 ** 9) INF = 10 ** 19 MOD = 10 ** 9 + 7 EPS = 10 ** -10 N, X, Y, Z = MAP() que = [-(a+1) for a in LIST()] heapify(que) for cur, cnt in [(10000, Z), (5000, Y), (1000, X)]: while que and cnt: a = -heappop(que) if a < cur: heappush(que, -a) break use = min(a // cur, cnt) cnt -= use a -= use * cur if a: heappush(que, -a) while que and cnt: heappop(que) cnt -= 1 if not que: Yes() else: No()