#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
const ll INF = 1e18;
const int MOD = 1000000007;

int main(){
        int n,x,y,z;
        cin >> n >> z >> y >> x;
        priority_queue<int> pq;
        bool ok = true;
        rep(i,n){
                int a;
                cin >> a;
                a++;
                pq.push(a);
        }

        while(x > 0 && !pq.empty()){
                int p = pq.top();
                pq.pop();
                if(p < 10000){
                        x--;
                }else{
                        if(x >= p/10000){
                                x -= p/10000;
                                p %= 10000;
                                if(p!=0) pq.push(p);
                        }else{
                                p -= x*10000;
                                x = 0;
                                if(p!=0) pq.push(p);
                        }
                }
        }

        while(y > 0 && !pq.empty()){
                int p = pq.top();
                pq.pop();
                if(p < 5000){
                        y--;
                }else{
                        if(y >= p/5000){
                                y -= p/5000;
                                p %= 5000;
                                if(p!=0) pq.push(p);
                        }else{
                                p -= y*5000;
                                y = 0;
                                if(p!=0) pq.push(p);
                        }
                }
        }

        while(z > 0 && !pq.empty()){
                int p = pq.top();
                pq.pop();
                if(p < 1000){
                        z--;
                }else{
                        if(z >= p/1000){
                                z -= p/1000;
                                p %= 1000;
                                if(p!=0)pq.push(p);
                        }else{
                                p -= z*1000;
                                z = 0;
                                if(p!=0)pq.push(p);
                        }
                }
        }



        if(pq.empty()) cout << "Yes" << endl;
        else cout << "No" << endl;
        return 0;
}