#include "bits/stdc++.h"

//#include <atcoder/all>

using namespace std;
//using namespace atcoder;

//#define int long long
#define ll long long

ll INF = (1LL << 60);
int mod = 1000000007;
using P = pair<int, int>;


signed main() {
	ll N, K; cin >> N >> K;
	map<ll, bool>mp;
	vector<ll>A(K);
	for (int i = 0; i < K; i++) {
		cin >> A[i]; A[i]--;
	}
	for (int i = 0; i < K; i++) {
		for (int j = 1; i + j < K && j < 6; j++) {
			ll dif = A[i + j] - A[i];
			if (dif == 1 || dif == 3 || dif == 5) {
				if (A[i] < 100) {
					mp[A[i]] = true;
					mp[A[i + j]] = true;
					if (0 <= A[i] - (7 - dif) / 2) {
						mp[A[i] - (7 - dif) / 2] = true;
					}
					for (int k = 99; k >= 0; k--) {
						for (int l = 1; l <= 6; l++) {
							if (mp.count(k + l) && mp.count(k + (7 - l))) {
								mp[k] = true;
							}
						}
					}
				}
				else {
					cout << "No" << endl; return 0;
				}
			}
			
		}
	}
	if (mp[0])cout << "No" << endl;
	else cout << "Yes" << endl;
	return 0;
}