#exec({'RUBY_THREAD_VM_STACK_SIZE'=>'100000000'},'/usr/bin/ruby', $0) if !ENV['RUBY_THREAD_VM_STACK_SIZE']
require 'prime'

def inpf() a=gets.chomp.split(" ").map(&:to_f)end

def inps() a=gets.chomp.split(" ")end

def copy(a) Marshal.load(Marshal.dump(a)) end

def kaijo(n,r = 10**9+7)(n < 2)? 1 : (2..n).inject{|memo,u|memo=(memo*u)%r} end

def na(n,d=0) Array.new(n,d)end

def na2(n,m,d=0) Array.new(n){Array.new(m,d)}end

def na3(n,m,l,d=0) Array.new(n){Array.new(m){Array.new(l,d)}}end

def inp() a=gets.chomp.split(" ").map(&:to_i)end

def r_up(a, b) (a+b-1)/b end

def sum(a) a.inject(:+) end

def big(a,b) return (a>b)? a:b end

def small(a,b) return (a<b)? a:b end
n,x,y,z = inp
a = inp
a.map!{|u|u+1}
a.sort_by!{|a|a%10000*-1}
m_c = a.sum{|u|u/10000}
a.map!{|u|u%10000}
if(z > m_c)
  (z-m_c).times do
    a.shift
  end
else
  a[0] += 10000 * (m_c - z)
end

if(a.size <= 0)
  puts "Yes"
  exit
end
a.sort_by!{|a|a%5000*-1}
m_c = a.sum{|u|u/5000}
a.map!{|u|u%5000}
if(y > m_c)
  (y-m_c).times do
    a.shift
  end
else
  a[0] += 5000 * (m_c - y)
end

if(a.size <= 0)
  puts "Yes"
  exit
end
a.sort_by!{|a|a%1000*-1}
m_c = a.sum{|u|u/1000}
a.map!{|u|u%1000}
if(x > m_c)
  (x-m_c).times do
    a.shift
  end
else
  a[0] += 1000 * (m_c - x)
end

if(a.size <= 0)
  puts "Yes"
  exit
end
puts "No"
i = 0