#include<bits/stdc++.h>
using namespace std;
//#define int long long
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define all(a) a.begin(),a.end()
#define rall(c) (c).rbegin(),(c).rend()
#define mp make_pair
#define endl '\n'
#define vec vector<ll>
#define mat vector<vector<ll> >
#define fi first
#define se second
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> pll;
typedef long double ld;
typedef complex<double> comp;
const ll INF=1e9+7;
const ll inf=INF;
const ll MOD=998244353;
const ll mod=MOD;
const int MAX=200010;

signed main(){
    ll n,k;cin>>n>>k;
    set<ll>st;
    rep(i,k){
        ll b;cin>>b;
        st.insert(b);
    }
    bool f=1;
    for(auto e:st){
        if(st.find(e+5)!=st.end()){
            if(e>=10)f=0;
            else {
                if(e==2||e==5||e==7||e==8)f=0;
            }
        }
        if(st.find(e+3)!=st.end()){
            if(e>=6)f=0;
            else if(e==3||e==4)f=0;
        }
        if(st.find(e+1)!=st.end()){
            if(e>=9)f=0;
            else if(e==4||e==6||e==7)f=0;
        }
    }
    if(f)cout<<"Yes"<<endl;
    else cout<<"No"<<endl;
}