#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#define popcount __builtin_popcount
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;

int main()
{
	int n; ll x, y, z;
	cin>>n>>x>>y>>z;
	ll a[100010];
	for(int i=0; i<n; i++){
		cin>>a[i];
		a[i]=a[i]/1000+1;
	}
	sort(a, a+n);
	for(int i=0; i<n; i++){
		ll b=a[i]/10;
		a[i]-=min(b, z)*10;
		z-=min(b, z);
	}
	assert(z>0);
	sort(a, a+n);
	for(int i=0; i<n; i++){
		ll b=a[i]/5;
		a[i]-=min(b, y)*5;
		y-=min(b, y);
	}
	sort(a, a+n);
	for(int i=0; i<n; i++){
		ll b=a[i];
		a[i]-=min(b, x);
		x-=min(b, x);
	}
	if(x){
		cout<<"Yes"<<endl;
		return 0;
	}
	int cnt=0;
	for(int i=0; i<n; i++) if(a[i]) cnt++;
	if(cnt<=y+z){
		cout<<"Yes"<<endl;
	}else{
		cout<<"No"<<endl;
	}
	return 0;
}