import java.util.*; import java.io.*; public class Main { static final int mod = (int) 1e9 + 7; static final int DX[] = { -1, 0, 1, 0 }, DY[] = { 0, -1, 0, 1 }; static final int[] DX8 = { -1, -1, -1, 0, 0, 1, 1, 1 }, DY8 = { -1, 0, 1, -1, 1, -1, 0, 1 }; static final int INF = Integer.MAX_VALUE / 3; static final long LINF = Long.MAX_VALUE / 3; static final String nextLine = "\n"; public static void main(String[] args) { FastScanner fs = new FastScanner(System.in); int n = fs.nextInt(); int x[] = fs.nextIntArray(3); int a[] = fs.nextIntArray(n); PriorityQueue pq1 = new PriorityQueue<>((p1,p2)->p2-p1);//1000円から4999円まで PriorityQueue pq2 = new PriorityQueue<>((p1,p2)->p2-p1);//5000円から9999円まで rsort(a); for(int i=0;i=10000) { int t = a[i] / 10000; if(t < x[2]) { x[2] -= t; int rem = a[i] % 10000; if(rem < 5000)pq1.add(rem); else pq2.add(rem); } else { a[i] -= 10000*x[2]; int s = a[i] / 5000; if(s < x[1]) { x[1] -= s; int rem = a[i] % 5000; pq1.add(rem); } else { a[i] -= 5000 * x[1]; int u = a[i]/1000; if(u0)x[2]--; else { if(x[1]>0) { t -= x[1]*5000; pq1.add(t); x[1]--; } else { int tmp = t/1000+1; if(x[0]>tmp)x[0] -= tmp; else { System.out.println("No"); return; } } } } for(int t:pq1) { if(x[1]>0)x[1]--; else { int tmp = t/1000+1; if(x[0]>tmp)x[0] -= tmp; else { System.out.println("No"); return; } } } System.out.println("Yes"); } //reverseOrderSort : O(NlogN) static void rsort(int[] ar) { Arrays.sort(ar); int len = ar.length; for (int i = 0; i < len / 2; i++) { int tmp = ar[i]; ar[i] = ar[len - 1 - i]; ar[len - 1 - i] = tmp; } } static void rsort(long[] ar) { Arrays.sort(ar); int len = ar.length; for (int i = 0; i < len / 2; i++) { long tmp = ar[i]; ar[i] = ar[len - 1 - i]; ar[len - 1 - i] = tmp; } } //MOD culculations static long plus(long x, long y) { long res = (x + y) % mod; return res < 0 ? res + mod : res; } static long sub(long x, long y) { long res = (x - y) % mod; return res < 0 ? res + mod : res; } static long mul(long x, long y) { long res = (x * y) % mod; return res < 0 ? res + mod : res; } static long div(long x, long y) { long res = x * pow(y, mod - 2) % mod; return res < 0 ? res + mod : res; } static long pow(long x, long y) { if (y < 0) return 0; if (y == 0) return 1; if (y % 2 == 1) return (x * pow(x, y - 1)) % mod; long root = pow(x, y / 2); return root * root % mod; } } //高速なScanner class FastScanner { private BufferedReader reader = null; private StringTokenizer tokenizer = null; public FastScanner(InputStream in) { reader = new BufferedReader(new InputStreamReader(in)); tokenizer = null; } public String next() { if (tokenizer == null || !tokenizer.hasMoreTokens()) { try { tokenizer = new StringTokenizer(reader.readLine()); } catch (IOException e) { throw new RuntimeException(e); } } return tokenizer.nextToken(); } public String nextLine() { if (tokenizer == null || !tokenizer.hasMoreTokens()) { try { return reader.readLine(); } catch (IOException e) { throw new RuntimeException(e); } } return tokenizer.nextToken("\n"); } public long nextLong() { return Long.parseLong(next()); } public int nextInt() { return Integer.parseInt(next()); } public double nextDouble() { return Double.parseDouble(next()); } public int[] nextIntArray(int n) { int[] a = new int[n]; for (int i = 0; i < n; i++) a[i] = nextInt(); return a; } public long[] nextLongArray(int n) { long[] a = new long[n]; for (int i = 0; i < n; i++) a[i] = nextLong(); return a; } }