//https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8 より
macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
    ($($r:tt)*) => {
        let s = {
            use std::io::Read;
            let mut s = String::new();
            std::io::stdin().read_to_string(&mut s).unwrap();
            s
        };
        let mut iter = s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
}

macro_rules! input_inner {
    ($iter:expr) => {};
    ($iter:expr, ) => {};
    ($iter:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($iter, $t);
        input_inner!{$iter $($r)*}
    };
}

macro_rules! read_value {
    ($iter:expr, ( $($t:tt),* )) => {
        ( $(read_value!($iter, $t)),* )
    };
    ($iter:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($iter, $t)).collect::<Vec<_>>()
    };
    ($iter:expr, chars) => {
        read_value!($iter, String).chars().collect::<Vec<char>>()
    };
    ($iter:expr, usize1) => {
        read_value!($iter, usize) - 1
    };
    ($iter:expr, $t:ty) => {
        $iter.next().unwrap().parse::<$t>().expect("Parse error")
    };
}

//

use std::cmp::*;

fn run() {
    input! {
        n: usize,
        c: [u64; 3],
        a: [u64; n],
    }
    let mut a = a;
    let mut c = c;
    let d = [1000, 5000, 10000];
    for a in a.iter_mut() {
        let v = min(c[2], *a / d[2]);
        *a -= v * d[2];
        c[2] -= v;
        let v = min(c[1] / 2, *a / d[2]);
        *a -= v * d[2];
        c[1] -= v * 2;
        let v = min(c[0] / 10, *a / d[2]);
        *a -= v * d[2];
        c[0] -= v * 10;
        if *a >= d[2] {
            println!("No");
            return;
        }
    }
    a.sort();
    while c[2] > 0 && a.len() > 0 {
        c[2] -= 1;
        a.pop();
    }
    for a in a.iter_mut() {
        let v = min(c[1], *a / d[1]);
        *a -= v * d[1];
        c[1] -= v;
        let v = min(c[0] / 5, *a / d[1]);
        *a -= v * d[1];
        c[0] -= v * 5;
        if *a >= d[1] {
            println!("No");
            return;
        }
    }
    a.sort();
    while c[1] > 0 && a.len() > 0 {
        c[1] -= 1;
        a.pop();
    }
    for a in a.iter_mut() {
        let v = min(c[0], *a / d[0]);
        *a -= v * d[0];
        c[0] -= v;
        if *a >= d[0] {
            println!("No");
            return;
        }
    }
    if c[0] >= a.len() as u64 {
        println!("Yes");
    } else {
        println!("No");
    }
}

fn main() {
    run();
}