#include #define rep(i,n) for(int i = 0; i < (n); ++i) #define srep(i,s,t) for (int i = s; i < t; ++i) #define drep(i,n) for(int i = (n)-1; i >= 0; --i) using namespace std; typedef long long int ll; typedef pair P; #define yn {puts("Yes");}else{puts("No");} #define MAX_N 200005 int main() { ll n, x, y, z; cin >> n >> x >> y >> z; ll a[n]; rep(i,n)cin >> a[i]; rep(i,n){ a[i] = a[i] / 1000 + 1; while(a[i] >= 10){ if(z > 0){ int aa = a[i] / 10; if(z >= aa){ a[i] -= aa * 10; z -= aa; }else{ a[i] -= z * 10; z = 0; } }else if(y > 0){ int aa = a[i] / 10; int yy = y / 2; if(yy >= aa){ a[i] -= aa * 10; y -= aa * 2; }else{ a[i] -= yy * 10; y -= yy * 2; } if(y == 1 && a[i] >= 5){ a[i] -= 5; y--; } }else if(x > 0){ if(x >= a[i]){ x -= a[i]; a[i] = 0; }else{ a[i] -= x; x = 0; } }else if(a[i] >= 10){ cout << "No" << endl; return 0; } } } int cnt[10] = {}; rep(i,n){ cnt[a[i]]++; } drep(i,10){ while(cnt[i]--){ int aa = i; if(z > 0){ z--; aa = 0; } if(aa == 0)continue; if(y > 0){ y--; aa = max(aa-5, 0); cnt[aa]++; aa = 0; } if(aa == 0) continue; if(x > 0){ if(aa > x){ cout << "No" << endl; return 0; } x -= aa; aa = 0; } if(aa > 0){ cout << "No" << endl; return 0; } } } cout << "Yes" << endl; return 0; }