#include <stdio.h>
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf 1000000300

int get(vector<long long> &ng,vector<int> &dp,long long pos){
	if(pos>=dp.size())return 1;
	if(dp[pos]!=-1)return dp[pos];
	int ret = 1;
	
	for(int i=1;i<=3;i++){
		int x = i;
		int y = 7-i;
		if(get(ng,dp,pos+i)==0&&get(ng,dp,pos+y)==0){
			ret = 0;
			break;
		}
	}
	
	if(binary_search(ng.begin(),ng.end(),pos)){
		ret = 0;
	}
	
	dp[pos] = ret;
	return ret;
}

int main(){	

	long long N,K;
	cin>>N>>K;
	
	vector<long long> A(K);
	rep(i,K){
		cin>>A[i];
		A[i]--;
	}
	
	while(A.size()>0){
		vector<long long> X;
		while(A.size()>0){
			if(X.size()==0 || abs(X.back()-A.back())<=100){
				X.push_back(A.back());
				A.pop_back();
			}
			else break;
		}
		reverse(X.begin(),X.end());
		if(X[0]>=100){
			long long x0 = X[0]-60;
			rep(i,X.size())X[i] -= x0;
			
		}
		
		
		
		vector<int> dp(X.back()+15,-1);
		if(get(X,dp,0)==0){
			cout<<"No"<<endl;
			return 0;
		}
	}
	
	cout<<"Yes"<<endl;
	
    return 0;
}