#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
//-------------------------------------------------------

ll N;
int K;
ll A[101];

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N>>K;
	set<ll> S;
	FOR(i,K) {
		cin>>A[i];
		S.insert(-(A[i]-1));
	}
	
	FOR(y,K) FOR(x,y) if(A[x]>=10) {
		if(A[y]-A[x]==1) return _P("No\n");
		if(A[y]-A[x]==3) return _P("No\n");
		if(A[y]-A[x]==5) return _P("No\n");
	}
	
	
	while(S.size()) {
		ll a=-*S.begin();
		S.erase(-a);
		if(a>100) continue;
		if(a<0) break;
		if(a==0) return _P("No\n");
		if(S.count(-(a-1))) S.insert(-(a-4));
		if(S.count(-(a-3))) S.insert(-(a-5));
		if(S.count(-(a-5))) S.insert(-(a-6));
	}
	
	cout<<"Yes"<<endl;
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}