#include <bits/stdc++.h>
#define rep(i,n) for(int i=(0);i<(n);i++)

using namespace std;

typedef long long ll;

int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);

	ll n;
	cin >> n;

	ll cnt[3];
	cin >> cnt[2] >> cnt[1] >> cnt[0];

	ll f[3] = {10000ll, 5000ll, 1000ll};
	priority_queue<ll> pq;

	rep(i, n){
		ll a;
		cin >> a;
		a++;

		pq.push(a);
	}

	rep(i, 3){
		while(cnt[i] > 0){
			ll t = pq.top();
			pq.pop();
			if(t == 0){
				cout << "Yes" << endl;
				return 0;
			}

			if(t >= f[i]){
				ll r = t / f[i];
				t -= min(r, cnt[i]) * f[i];
				cnt[i] -= min(r, cnt[i]);
				pq.push(t);
			}else{
				cnt[i]--;
				pq.push(0);
			}
		}
	}

	if(pq.top() == 0){
		cout << "Yes" << endl;
	}else{
		cout << "No" << endl;
	}
	
}