#include<bits/stdc++.h>
#include<unordered_set>
#include<unordered_map>
using namespace std;
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define all(a) a.begin(),a.end()
#define rall(c) (c).rbegin(),(c).rend()
#define mp make_pair
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef long double ld;
const ll inf=1e9+7;
const ll mod=1e9+7;
int main(){
    ll n,x,y,z;
    cin>>n>>x>>y>>z;
    bool f=1;
    rep(i,n){
        ll a;cin>>a;
        a-=a%1000LL;
        a+=1000LL;
        if(a%5000LL){
        if(a%5000LL<=x*1000LL){
            x-=(a%5000LL)/1000LL;
            a-=a%5000LL;
        }else{
            a-=a%5000LL;
            a+=5000LL;
        }
        }
        if(a%10000LL){
        if(a%10000LL<=y*5000LL){
            y-=(a%10000LL)/5000LL;
            a-=a%10000LL;
        }else if(a%10000LL<=x*1000LL){
            x-=(a%10000LL)/1000LL;
            a-=a%10000LL;
        }else{
            a-=a%10000LL;
            a+=10000LL;
        }
        }
        if(a/10000LL<=z){
            z-=a/10000LL;
            a=0;
        }else{
            a-=z*10000LL;
            z=0;
        }
        if(a/5000LL<=y){
            y-=a/5000LL;
            a=0;
        }else{
            a-=y*5000LL;
            y=0;
        }
        if(a/1000LL<=x){
            x-=a/1000LL;
            a=0;
        }else{
            a-=x*1000LL;
            x=0;
        }
        if(a)f=0;
    }
    if(f)cout<<"Yes"<<endl;
    else cout<<"No"<<endl;
}