#include <cstdio>
#include <iostream>
#include <string>
#include <sstream>
#include <stack>
#include <algorithm>
#include <cmath>
#include <queue>
#include <map>
#include <set>
#include <cstdlib>
#include <bitset>
#include <tuple>
#include <assert.h>
#include <deque>
#include <bitset>
#include <iomanip>
#include <limits>
#include <chrono>
#include <random>
#include <array>
#include <unordered_map>
#include <functional>
#include <complex>
#include <numeric>

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

constexpr long long MAX = 5100000;
constexpr long long INF = 1LL << 60;
constexpr int inf = 1 << 28;
//constexpr long long mod = 1000000007LL;
//constexpr long long mod = 998244353LL;

using namespace std;
typedef unsigned long long ull;
typedef long long ll;


int main()
{
	/*
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	*/

	ll n, x, y, z; scanf("%lld %lld %lld %lld", &n, &x, &y, &z);
	vector<ll> a(n); for (int i = 0; i < n; i++) scanf("%lld", &a[i]), a[i]++;
	sort(a.rbegin(), a.rend());
	for (int i = 0; i < n; i++) {
		ll mn = min((a[i] + 9999) / 10000, z);
		a[i] -= mn * 10000;
		if (a[i] < 0) a[i] = 0;
		z -= mn;
	}
	sort(a.rbegin(), a.rend());
	for (int i = 0; i < n; i++) {
		ll mn = min((a[i] + 4999) / 5000, y);
		a[i] -= mn * 5000;
		if (a[i] < 0) a[i] = 0;
		y -= mn;
	}
	sort(a.rbegin(), a.rend());
	for (int i = 0; i < n; i++) {
		ll mn = min((a[i] + 999) / 1000, x);
		a[i] -= mn * 1000;
		if (a[i] < 0) a[i] = 0;
		x -= mn;
	}
	sort(a.rbegin(), a.rend());
	if (a[0] == 0) puts("Yes");
	else puts("No");
	return 0;
}