#include <bits/stdc++.h>

using namespace std;

using int64 = long long;
//const int mod = 1e9 + 7;
const int mod = 998244353;

const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;

struct IoSetup {
  IoSetup() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
  }
} iosetup;


template< typename T1, typename T2 >
ostream &operator<<(ostream &os, const pair< T1, T2 > &p) {
  os << p.first << " " << p.second;
  return os;
}

template< typename T1, typename T2 >
istream &operator>>(istream &is, pair< T1, T2 > &p) {
  is >> p.first >> p.second;
  return is;
}

template< typename T >
ostream &operator<<(ostream &os, const vector< T > &v) {
  for(int i = 0; i < (int) v.size(); i++) {
    os << v[i] << (i + 1 != v.size() ? " " : "");
  }
  return os;
}

template< typename T >
istream &operator>>(istream &is, vector< T > &v) {
  for(T &in : v) is >> in;
  return is;
}

template< typename T1, typename T2 >
inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }

template< typename T1, typename T2 >
inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }

template< typename T = int64 >
vector< T > make_v(size_t a) {
  return vector< T >(a);
}

template< typename T, typename... Ts >
auto make_v(size_t a, Ts... ts) {
  return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...));
}

template< typename T, typename V >
typename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {
  t = v;
}

template< typename T, typename V >
typename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {
  for(auto &e : t) fill_v(e, v);
}

template< typename F >
struct FixPoint : F {
  FixPoint(F &&f) : F(forward< F >(f)) {}

  template< typename... Args >
  decltype(auto) operator()(Args &&... args) const {
    return F::operator()(*this, forward< Args >(args)...);
  }
};

template< typename F >
inline decltype(auto) MFP(F &&f) {
  return FixPoint< F >{forward< F >(f)};
}


int main() {
  int64 N, K;
  cin >> N >> K;
  vector< int64 > A(K);
  cin >> A;
  vector< int64 > now{1};


  for(int i = 0; i < K; i++) {
    map< int64, bool > dp;
    auto rec = MFP([&](auto rec, int64 idx) -> bool {
      if(idx > now.back()) return true;
      if(dp.count(idx)) return dp[idx];
      if(find(begin(A), end(A), idx) != end(A)) return dp[idx] = false;
      for(int i = 1; i <= 3; i++) {
        if(!rec(idx + i) && !rec(idx + 7 - i)) return dp[idx] = false;
      }
      dp[idx] = true;
      return true;
    });
    if(A[i] - now.back() > 100) {
      if(now.front() == 1) {
        if(!rec(1)) {
          cout << "No\n";
          return 0;
        }
      } else {
        bool f = rec(now.front() - 1) && rec(now.front() - 3) && rec(now.front() - 5) && rec(now.front() - 7) && rec(now.front() - 9);
        bool g = rec(now.front() - 2) && rec(now.front() - 4) && rec(now.front() - 6) && rec(now.front() - 8) && rec(now.front() - 10);
        if(!f && !g) {
          cout << "No\n";
          return 0;
        }
      }
      now.clear();
    }
    now.emplace_back(A[i]);
    if(i + 1 == K) {
      if(now.front() == 1) {
        if(!rec(1)) {
          cout << "No\n";
          return 0;
        }
      } else {
        bool f = rec(now.front() - 1) && rec(now.front() - 3) && rec(now.front() - 5) && rec(now.front() - 7) && rec(now.front() - 9);
        bool g = rec(now.front() - 2) && rec(now.front() - 4) && rec(now.front() - 6) && rec(now.front() - 8) && rec(now.front() - 10);
        if(!f && !g) {
          cout << "No\n";
          return 0;
        }
      }
    }
  }
  cout << "Yes\n";
}