#include using namespace std; typedef long long ll; #define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; i++) #define reps(i, s, n) for(ll i = (s), i##_len = (n); i < i##_len; i++) #define rrep(i, n) for(ll i = (n) - 1; i >= 0; i--) #define rreps(i, e, n) for(ll i = (n) - 1; i >= (e); i--) #define all(x) (x).begin(), (x).end() #define rall(x) (x).rbegin(), (x).rend() #define sz(x) ((ll)(x).size()) #define len(x) ((ll)(x).length()) #define endl "\n" int main() { cin.tie(0); ios::sync_with_stdio(false); // ifstream in("input.txt"); // cin.rdbuf(in.rdbuf()); ll n, x, y, z; cin >> n >> x >> y >> z; vector a(n); rep(i, n) cin >> a[i]; priority_queue pq; rep(i, n) pq.push(a[i] + 1); while((!pq.empty()) && (z > 0)) { ll v = pq.top(); pq.pop(); ll zc = min(z, v / 10000); if (zc == 0) { pq.push(v); break; } z -= zc; v -= zc * 10000; if (v > 0) pq.push(v); } while((!pq.empty()) && (z > 0)) { ll v = pq.top(); pq.pop(); v -= 10000; z--; if (v > 0) pq.push(v); } while((!pq.empty()) && (y > 0)) { ll v = pq.top(); pq.pop(); ll yc = min(y, v / 5000); if (yc == 0) { pq.push(v); break; } y -= yc; v -= yc * 5000; if (v > 0) pq.push(v); } while((!pq.empty()) && (y > 0)) { ll v = pq.top(); pq.pop(); v -= 5000; y--; if (v > 0) pq.push(v); } while((!pq.empty()) && (x > 0)) { ll v = pq.top(); pq.pop(); ll xc = min(x, v / 1000); if (xc == 0) { pq.push(v); break; } x -= xc; v -= xc * 1000; if (v > 0) pq.push(v); } while((!pq.empty()) && (x > 0)) { ll v = pq.top(); pq.pop(); v -= 1000; x--; if (v > 0) pq.push(v); } if (sz(pq) > 0) { cout << "No" << endl; } else { cout << "Yes" << endl; } return 0; }