#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;
}

ll UNKO=10000000000000ll;

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

    rep(i,k-6){
        bool f=true;
        for(int j=0;j<=6;j++){
            if(a[j]-a[i]!=j) f=false;
        }
        if(!f){
            cout<<"No"<<endl;
            return 0;
        }
    }

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

    map<ll,bool> check;
    rep(i,k) check[a[i]]=false;

    function<bool(ll)> dfs=[&](ll m){
        if(m>=n) return true;
        if(check.count(m)) return check[m];

        ll mi=LINF;
        rep(i,k){
            if(a[i]<m) break;
            chmin(mi,a[i]-m);
        }

        if(mi>=UNKO) return check[m]=true;

        for(int x=1;x<=6;x++){
            if(!dfs(m+x) and !dfs(m+7-x)) return check[m]=false;
        }
        return check[m]=true;
    };
    cout<<(dfs(1)?"Yes":"No")<<endl;
    return 0;
}