#include using namespace std; #define F first #define S second #define R cin>> #define Z class #define ll long long #define ln cout<<'\n' #define in(a) insert(a) #define pb(a) push_back(a) #define pd(a) printf("%.10f\n",a) #define mem(a) memset(a,0,sizeof(a)) #define all(c) (c).begin(),(c).end() #define iter(c) __typeof((c).begin()) #define rrep(i,n) for(ll i=(ll)(n)-1;i>=0;i--) #define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++) #define rep(i,n) REP(i,0,n) #define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++) templatevoid pr(A a){cout<void pr(A a,B b){cout<void pr(A a,B b,C c){cout<void pr(A a,B b,C c,D d){cout<void PR(A a,ll n){rep(i,n){if(i)cout<<' ';cout<=0&&x=0&&y P; void Main() { ll n,c[3],d[3]={1000,5000,10000}; cin >> n; rep(i,3) cin >> c[i]; ll a[n]; rep(i,n) { cin >> a[i]; a[i]++; } rrep(k,3) { rep(i,n) { if(a[i]>=d[k]) { ll x=min(c[k],a[i]/d[k]); a[i]-=x*d[k]; c[k]-=x; } } sort(a,a+n,greater()); rep(i,n) { if(a[i]>0) { ll x=min(c[k],(ll)ceil((double)a[i]/d[k])); a[i]-=x*d[k]; c[k]-=x; } } } rep(i,n) { if(a[i]>0) { pr("No"); return; } } pr("Yes"); } int main(){ios::sync_with_stdio(0);cin.tie(0);Main();return 0;}