#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) begin(v),end(v)
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
using ll = long long;
using pii = pair<int, int>;
constexpr ll INF = 1ll<<30;
constexpr ll longINF = 1ll<<60;
constexpr ll MOD = 1000000007;
constexpr bool debug = false;
//---------------------------------//

int main() {
	int N, C[3];
	cin >> N >> C[0] >> C[1] >> C[2];
	int mn[3] = {1, 5, 10};
	vector<int> A(N);
	REP(i, N) {
		scanf("%d", &A[i]);
		A[i] = A[i] / 1000 + 1;
	}
	
	for (int i = 2; i >= 0; --i) {
		sort(ALL(A), greater<int>());
		REP(j, N) {
			for (int k = 2; k >= i; --k) {
				if (A[j] < 0) break;
				int cur;
				if (i == k) cur = min(A[j] / mn[k], C[k]);
				else cur = min((A[j] + mn[k] - 1) / mn[k], C[k]);
				A[j] -= cur * mn[k];
				C[k] -= cur;
			}
		}
	}
	if (*max_element(ALL(A)) > 0) puts("No");
	else puts("Yes");
}