#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) begin(v),end(v)
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
using ll = long long;
using pii = pair<int, int>;
constexpr ll INF = 1ll<<30;
constexpr ll longINF = 1ll<<60;
constexpr ll MOD = 1000000007;
constexpr bool debug = false;
//---------------------------------//

int main() {
	ll N, K;
	cin >> N >> K;
	vector<ll> A(K);
	REP(i, K) scanf("%lld", &A[i]);
	
	puts([&]() -> bool {
		REP(i, K) FOR(j, i + 1, K) {
			if (A[i] < 10) continue;
			const int d = A[j] - A[i];
			if (d > 5) break;
			if (d == 1 || d == 3 || d == 5) return false;
		}
		bool ok[16];
		fill(ok, ok + 16, true);
		REP(i, K) {
			if (A[i] >= 16) break;
			ok[A[i]] = false;
		}
		for (int i = 9; i >= 1; --i)FOR(j, 1, 4) ok[i] &= ok[i + j] || ok[i + 7 - j];
		return ok[1];
	}() ? "Yes": "No");
}