import std.stdio, std.conv, std.functional, std.string;
import std.algorithm, std.array, std.container, std.range, std.typecons;
import std.bigint, std.numeric, std.math, std.random;
import core.bitop;

string FMT_F = "%.10f";

static File _f;
void file_io(string fn) { _f = File(fn, "r"); }
static string[] s_rd;
T _RD(T = long)() { while(!s_rd.length) s_rd = readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; }
T _RD(T = long)(File f) { while(!s_rd.length) s_rd = f.readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; }
T[] _RDA(T = long)(T fix = 0) { auto r = readln.chomp.split.to!(T[]); r[] += fix; return r; }
T[] _RDA(T = long)(File f, T fix = 0) { auto r = f.readln.chomp.split.to!(T[]); r[] += fix; return r; }
T RD(T = long)() { if (_f.isOpen) return _RD!T(_f); else return _RD!T; }
T[] RDA(T = long)(T fix = 0) { if (_f.isOpen)  return _RDA!T(_f, fix); else return _RDA!T(fix); }

size_t[] MAKE_IDX(alias less = "a < b", Range)(Range range) { auto idx = new size_t[](range.length); makeIndex!(less)(range, idx); return idx;}
size_t MIN_POS(alias less = "a < b", Range)(Range range) { auto r = minPos!(less)(range); return range.length - r.length; }

void chmin(T)(ref T x, T y) { x = min(x, y); } void chmax(T)(ref T x, T y) { x = max(x, y); }
bool inside(T)(T x, T b, T e) { return x >= b && x < e; }
T lcm(T)(T x, T y) { return x * (y / gcd(x, y)); }

//long mod = 10^^9 + 7;
long mod = 998_244_353;
//long mod = 1_000_003;
void moda(T)(ref T x, T y) { x = (x + y) % mod; }
void mods(T)(ref T x, T y) { x = ((x + mod) - (y % mod)) % mod; }
void modm(T)(ref T x, T y) { x = (x * y) % mod; }
void modpow(T)(ref T x, T y) { if (!y) { x = 1; return; } auto t = x; x.modpow(y>>1); x.modm(x); if (y&1) x.modm(t); }
void modd(T)(ref T x, T y) { x.modm(y.modpow(mod - 2)); }

void main()
{
	auto N = RD;
	auto X = RD;
	auto Y = RD;
	auto Z = RD;
	auto A = RDA;

	auto over = new bool[](N);
	A.sort!"a % 5000 < b % 5000"();
	bool ok = true;
	foreach (i; 0..N)
	{
		auto a = A[i] % 5000;
		if (a % 1000)
			over[i] = true;
		A[i] -= a;
		a = (a+999) / 1000;
		if (X >= a)
		{
			X -= a;
		}
		else if (Y != 0)
		{
			over[i] = true;
			--Y;
		}
		else if (Z != 0)
		{
			over[i] = true;
			--Z;
		}
		else
		{
			ok = false;
		}
	}
	debug writeln(A);
	debug writeln(over);

	auto index = A.MAKE_IDX!"a % 10000 < b % 10000"();
	foreach (i; index)
	{
		auto a = A[i] % 10000;
		if (a % 5000)
			over[i] = true;
		A[i] -= a;
		a = (a+4999) / 5000;
		if (X >= 5)
		{
			auto cnt = min(a, X / 5);
			X -= cnt*5;
			a -= cnt;
		}

		if (Y >= a)
		{
			Y -= a;
		}
		else if (Z != 0)
		{
			over[i] = true;
			--Z;
		}
		else
		{
			ok = false;
		}
	}
	debug writeln(A);
	debug writeln(over);

	foreach (i; 0..N)
	{
		if (A[i] % 10000)
			over[i] = true;
		auto a = (A[i]+9999) / 10000;
		if (X >= 10)
		{
			auto cnt = min(a, X / 10);
			X -= cnt*10;
			a -= cnt;
		}
		if (Y >= 2)
		{
			auto cnt = min(a, Y / 2);
			Y -= cnt*2;
			a -= cnt;
		}

		if (Z >= a)
		{
			Z -= a;
		}
		else
		{
			ok = false;
		}
	}

	long cnt;
	foreach (i; 0..N)
	{
		if (!over[i])
			++cnt;
	}

	debug writeln(A);
	debug writeln(over);
	if (cnt > X+Y+Z)
	{
		ok = false;
	}

	writeln(ok ? "Yes" : "No");
	stdout.flush;
	debug readln;
}