#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
#include<assert.h>
#include<numeric>
using namespace std;
#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )
#define rep(i,n) REP(i,0,n)
using ll = long long;
constexpr int inf=1e9+7;
constexpr ll longinf=1LL<<60 ;
constexpr ll mod=1e9+7 ;

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n;
    cin>>n;
    ll xx,yy,zz;
    cin>>xx>>yy>>zz;
    vector<ll> b(n);
    rep(i,n)cin>>b[i];
    rep(_,30){
       
        int cnt = 0;
        ll x = xx, y=yy,z=zz;
    rep(i,n){
        ll a=b[i];
        int s = min(a/10000,z);
        a -= s*10000;
        z -= s;
        int t = min(a/5000,y);
        a -= t*5000;
        y -= t;
        int u = min(a/1000,x);
        a -= u*1000;
        x -= u;
        if(a<1000 && x){
            x--;
        }
        else if(a<5000 && y){
            while(a<5000 && u>0){
                --u;
                ++x;
                a+=1000;
            }
            y--;
        }
        else if(a<10000 && z){
            while(a<10000 && u>0){
                --u;
                ++x;
                a+=1000;
            }
            while(a<10000 && t>0){
                --t;
                ++y;
                a+=5000;
            }

            z--;
        }
        else {
            ++cnt;
        }
    }
    if(!cnt){
        cout<<"Yes"<<endl;
        return 0;
    }
     random_shuffle(b.begin(),b.end());
    }
    cout<<"No"<<endl;
    return 0;
}