#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 10000;
int n, k;
int cont, aux, imp, oth;
int arr[MAX_N];
int main() {
  scanf("%d%d", &n, &k);
  cont = n;
  for (int i = 0; i < k; i++) {
    scanf("%d", arr + i);
    aux = min(arr[i] / 4, cont);
    cont -= aux;
    arr[i] -= 4 * aux;
    if (arr[i] % 2) imp++;
  }
  imp = min(imp, cont);
  oth = cont - imp;
  cont += 2 * n;
  for (int i = 0; i < k; i++) {
    if (arr[i] % 2 and imp) imp--, arr[i]--;
    aux = min((arr[i] + 1) / 2, cont);
    arr[i] -= aux * 2;
    if (arr[i] < 0) arr[i] = 0;
    cont -= aux;
  }
  cont += oth;
  for (int i = 0; i < k; i++) cont -= arr[i];
  if (cont >= 0)
    printf("YES\n");
  else
    printf("NO\n");
  return 0;
}
