#include<bits/stdc++.h>
using namespace std;
#define ALL(x) begin(x),end(x)
#define rep(i,n) for(int i=0;i<(n);i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define mod 1000000007
using ll=long long;
const int INF=1000000000;
const ll LINF=1001002003004005006ll;
int dx[]={1,0,-1,0},dy[]={0,1,0,-1};
// ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;}

struct IOSetup{
    IOSetup(){
        cin.tie(0);
        ios::sync_with_stdio(0);
        cout<<fixed<<setprecision(12);
    }
} iosetup;
 
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==(int)v.size()?"":" ");
    return os;
}
template<typename T>
istream &operator>>(istream &is,vector<T>&v){
    for(T &x:v)is>>x;
    return is;
}


signed main(){
    ll n,k;cin>>n>>k;
    vector<ll> a(k);
    cin>>a;

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

    sort(ALL(a));reverse(ALL(a));


    map<int,int> pj;
    bool update=true;
    while(update){
        update=false;

        rep(i,(int)a.size()){
            for(int j=max(i+1,pj[i]);j<(int)a.size();j++){
                if(abs(a[i]-a[j])>=150000000000ll) break;
                pj[i]=j+1;
                for(int x=1;x<=6;x++){
                    if(a[i]-x!=a[j]+x-7) continue;
                    ll p=a[i]-x;
                    if(!(1<=p and p<=n)) continue;
                    if(st.count(p)) continue;
                    a.push_back(p);
                    st.insert(p);
                    update=true;
                }
            }
        }
    }
    if(st.count(1)) cout<<"No"<<endl;
    else cout<<"Yes"<<endl;
    return 0;
}