#include <cassert>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <climits>
#include <map>
#include <queue>
#include <set>
#include <cstring>
#include <vector>

using namespace std;
typedef long long ll;

int main() {
  ll N, K;
  cin >> N >> K;
  vector<ll> A(K);
  map<ll, bool> out;

  for (int i = 0; i < K; ++i) {
    cin >> A[i];
    out[A[i]] = true;
  }

  map<ll, bool> checked;
  priority_queue <ll> pque;

  for (ll a : A) {
    for (ll i = 1; i <= 6; ++i) {
      ll na = a - i;
      if (na >= 1 && not out[na]) {
        pque.push(na);
      }
    }
  }

  while (not pque.empty()) {
    ll x = pque.top();
    pque.pop();

    if (checked[x]) continue;
    checked[x] = true;
    bool all_out = true;

    for (ll i = 1; i <= 6; ++i) {
      ll j = 7 - i;

      ll a1 = x + i;
      ll a2 = x + j;

      if (out[a1] && out[a2]) {
        out[x] = true;

        for (ll i = 1; i <= 6; ++i) {
          ll nx = x - i;
          if (nx >= 1 && not out[nx]) {
            pque.push(nx);
          }
        }
      } else {
        all_out = false;
      }
    }

    if (all_out) {
      cout << "No" << endl;
      return 0;
    }
  }

  if (out[1]) {
    cout << "No" << endl;
  } else {
    cout << "Yes" << endl;
  }

  return 0;
}