#include #define rep(i,a,b) for(int i=a;i=b;i--) #define fore(i,a) for(auto &i:a) #define all(x) (x).begin(),(x).end() //#pragma GCC optimize ("-O3") using namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); } typedef long long ll; const int inf = INT_MAX / 2; const ll infl = 1LL << 60; templatebool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; } templatebool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; } //--------------------------------------------------------------------------------------------------- /*---------------------------------------------------------------------------------------------------             ∧_∧       ∧_∧  (´<_` )  Welcome to My Coding Space!      ( ´_ゝ`) /  ⌒i @hamayanhamayan0     /   \    | |     /   / ̄ ̄ ̄ ̄/  |   __(__ニつ/  _/ .| .|____      \/____/ (u ⊃ ---------------------------------------------------------------------------------------------------*/ int N; ll X, Y, Z, A[101010]; //--------------------------------------------------------------------------------------------------- #define yes "Yes" #define no "No" string solve() { rep(i, 0, N) { ll a = A[i]; a = a / 1000; ll z = min(Z, a / 10); Z -= z; a -= z * 10; if (X + Y * 5 <= a) { if (Z == 0) return no; Z--; continue; } ll y = min(Y, a / 5); Y -= y; a -= y * 5; if (X <= a) { if (Y == 0) return no; Y--; continue; } ll x = min(X, a); X -= x; a -= x; if (a != 0) return no; if (X == 0) return no; X--; } return yes; } //--------------------------------------------------------------------------------------------------- void _main() { cin >> N >> X >> Y >> Z; rep(i, 0, N) cin >> A[i]; cout << solve() << endl; }