#include <bits/stdc++.h>
using namespace std;

#define REP(i,n) for(ll i=0;i<(ll)n;i++)
#define dump(x)  cerr << "Line " << __LINE__ << ": " <<  #x << " = " << (x) << "\n";
#define spa << " " <<
#define fi first
#define se second
#define ALL(a)  (a).begin(),(a).end()
#define ALLR(a)  (a).rbegin(),(a).rend()

using ld = long double;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<ld, ld>;

template<typename T> using V = vector<T>;
template<typename T> using P = pair<T, T>;
template<typename T> vector<T> make_vec(size_t n, T a) { return vector<T>(n, a); }
template<typename... Ts> auto make_vec(size_t n, Ts... ts) { return vector<decltype(make_vec(ts...))>(n, make_vec(ts...)); }
template<class S, class T> ostream& operator << (ostream& os, const pair<S, T> v){os << "(" << v.first << ", " << v.second << ")"; return os;}
template<typename T> ostream& operator<<(ostream &os, const vector<T> &v) { for (auto &e : v) os << e << ' '; return os; }
template<class T> ostream& operator<<(ostream& os, const vector<vector<T>> &v){ for(auto &e : v){os << e << "\n";} return os;}
struct fast_ios { fast_ios(){ cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;

template <class T> void UNIQUE(vector<T> &x) {sort(ALL(x));x.erase(unique(ALL(x)), x.end());}
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
void fail() { cout << -1 << '\n'; exit(0); }
inline int popcount(const int x) { return __builtin_popcount(x); }
inline int popcount(const ll x) { return __builtin_popcountll(x); }
template<typename T> void debug(vector<vector<T>>&v,ll h,ll w){for(ll i=0;i<h;i++)
{cerr<<v[i][0];for(ll j=1;j<w;j++)cerr spa v[i][j];cerr<<"\n";}};
template<typename T> void debug(vector<T>&v,ll n){if(n!=0)cerr<<v[0];
for(ll i=1;i<n;i++)cerr spa v[i];
cerr<<"\n";};

const ll INF = (1ll<<62);
// const ld EPS   = 1e-10;
// const ld PI    = acos(-1.0);
const ll mod = (int)1e9 + 7;
//const ll mod = 998244353;

int main(){

    ll N, K;
    cin >> N >> K;
    V<ll> A(K);
    REP(i, K) cin >> A[i];
    reverse(ALL(A));

    ll pos = 0;
    while(1){
        if(pos>100) break;
        if(pos>=(int)A.size()){
            break;
        }
        ll a = A[pos];

        REP(j, A.size()){
            if(A[j] == a+5 and a-1>0){
                A.push_back(a-1);
            }
        }

        REP(j, A.size()){
            if(A[j] == a+3 and a-2>0){
                A.push_back(a-2);
            }
        }

        REP(j, A.size()){
            if(A[j] == a+1 and a-3>0){
                A.push_back(a-3);
            }
        }

        UNIQUE(A);
        reverse(ALL(A));
        pos++;
    }

    // while(1){
    //     if(cnt>100) break;
    //     ll x = *next(st.begin(), cnt);
    //     dump(x)

    //     if(st.count(x-5) and x+1<0){
    //         st.insert(x+1);
    //     }

    //     if(st.count(x-3) and x+2<0){
    //         st.insert(x+2);
    //     }

    //     if(st.count(x-1) and x+3<0){
    //         st.insert(x+3);
    //     }
    //     cnt++;
    // }

    // for(auto x: st) B.push_back(-x);
    sort(ALL(A));

    //dump(A)

    ll sz = A.size();
    bool ok = false;
    REP(i, sz-6+1){
        bool flag = true;
        REP(j, 5){
            if(A[i+j]+1 != A[i+j+1]){
                flag = false;
            }
        }
        if(flag) ok = true;
    }

    if(A[0] == 1 or ok){
        cout << "No\n";
    }else{
        cout << "Yes\n";
    }

    return 0;
}