using static System.Math;
using System.Collections.Generic;
using System;

public class PriorityQueue<T> where T : IComparable
{
	private IComparer<T> _comparer = null;
	private int _type = 0;
	private T[] _heap;
	private int _sz = 0;
	private int _count = 0;
	public PriorityQueue(int maxSize, IComparer<T> comparer)
	{
		_heap = new T[maxSize];
		_comparer = comparer;
	}
	public PriorityQueue(int maxSize, int type = 0)
	{
		_heap = new T[maxSize];
		_type = type;
	}
	private int Compare(T x, T y)
	{
		if (_comparer != null) return _comparer.Compare(x, y);
		return _type == 0 ? x.CompareTo(y) : y.CompareTo(x);
	}
	public void Push(T x)
	{
		_count++;
		var i = _sz++;
		while (i > 0)
		{
			var p = (i - 1) / 2;
			if (Compare(_heap[p], x) <= 0) break;
			_heap[i] = _heap[p];
			i = p;
		}
		_heap[i] = x;
	}
	public T Pop()
	{
		_count--;
		T ret = _heap[0];
		T x = _heap[--_sz];
		int i = 0;
		while (i * 2 + 1 < _sz)
		{
			int a = i * 2 + 1;
			int b = i * 2 + 2;
			if (b < _sz && Compare(_heap[b], _heap[a]) < 0) a = b;
			if (Compare(_heap[a], x) >= 0) break;
			_heap[i] = _heap[a];
			i = a;
		}
		_heap[i] = x;
		return ret;
	}
	public int Count() => _count;
	public T Peek() => _heap[0];
	public bool Contains(T x)
	{
		for (int i = 0; i < _sz; i++) if (x.Equals(_heap[i])) return true;
		return false;
	}
	public void Clear()
	{
		while (this.Count() > 0) this.Pop();
	}
	public IEnumerator<T> GetEnumerator()
	{
		var ret = new List<T>();
		while (this.Count() > 0)
		{
			ret.Add(this.Pop());
		}
		foreach (var r in ret)
		{
			this.Push(r);
			yield return r;
		}
	}
	public T[] ToArray()
	{
		T[] array = new T[_sz];
		int i = 0;
		foreach (var r in this)
		{
			array[i++] = r;
		}
		return array;
	}
}


public class Hello
{
	public static int n, x, y, z;
    static void Main()
    {
        string[] line = Console.ReadLine().Trim().Split(' ');
         n = int.Parse(line[0]);
        x = int.Parse(line[1]);
        y = int.Parse(line[2]);
        z = int.Parse(line[3]);
        line = Console.ReadLine().Trim().Split(' ');
        var a = Array.ConvertAll(line, int.Parse);
		getAns(a);
    }
	static void getAns (int[] a)
    {
		var pq = new PriorityQueue<int>(n, 1);
		for (int i = 0; i < n; i++) pq.Push(a[i]);
        while (pq.Count() > 0)
        {
			var t = pq.Pop();
			if (z > 0)
			{
				if (t >= 10000)
				{
					var t1 = t / 10000;
					var t2 = Min(z, t1);
					z -= t2;
					t -= t1 * 10000;
					pq.Push(t);
				}
				else z--;
			}
			else if (y > 0)
            {
				if (t >= 5000)
				{
					var t1 = t / 5000;
					var t2 = Min(y, t1);
					y -= t2;
					t -= t1 * 5000;
					pq.Push(t);
				}
				else y--;
			}
			else if (x > 0)
            {
				if (t >= 1000)
				{
					var t1 = t / 1000;
					var t2 = Min(x, t1);
					x -= t2;
					t -= t1 * 1000;
					pq.Push(t);
				}
				else x--;
			}
			else
            {
                Console.WriteLine("No");
				return;
            }

		}
        Console.WriteLine("Yes");
    }
}