// Template
#include "bits/stdc++.h"
#define rep_override(x, y, z, name, ...) name
#define rep2(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep3(i, l, r) for (int i = (int)(l); i < (int)(r); ++i)
#define rep(...) rep_override(__VA_ARGS__, rep3, rep2)(__VA_ARGS__)
#define per(i, n) for (ll i = (ll)(n) - 1; i >= 0; --i)
#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
constexpr int inf = 1001001001;
constexpr ll INF = 3003003003003003003LL;
template <typename T>
inline bool chmin(T &x, const T &y) {
    if (x > y) {
        x = y;
        return true;
    }
    return false;
}
template <typename T> 
inline bool chmax(T &x, const T &y) {
    if (x < y) {
        x = y;
        return true;
    }
    return false;
}
struct IOSET {
    IOSET() {
        cin.tie(nullptr);
        ios::sync_with_stdio(false);
        cout << fixed << setprecision(10);
    }
} ioset;

// Main
int main() {
    ll n, k;
    cin >> n >> k;
    vector<ll> a(k);
    rep(i, k) cin >> a[i];

    set<ll> st;
    rep(i, k) st.insert(a[i]);

    while (st.size() > 1) {
        ll x = *rbegin(st);
        if (x <= 0) break;
        if (st.count(x - 1)) {
            if (x - 4 == 1) {
                cout << "No\n";
                return 0;
            }
            st.insert(x - 4);
        }
        if (st.count(x - 3)) {
            if (x - 5 == 1) {
                cout << "No\n";
                return 0;
            }
            st.insert(x - 5);
        }
        if (st.count(x - 5)) {
            if (x - 6 == 1) {
                cout << "No\n";
                return 0;
            }
            st.insert(x - 6);
        }
        st.erase(x);
    }
    cout << "Yes\n";
    return 0;
}