#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]);
	
	int dp[60][1 << 6];
	REP(i, 1 << 6) {
		int ns = i << 1;
		FOR(j, 1, 4) ns |= ns >> j & ns >> (7 - j) & 1;
		dp[0][i] = ns & ~(~0 << 6);
	}
	REP(i, 59) REP(j, 1 << 6) dp[i + 1][j] = dp[i][dp[i][j]];
	
	auto move = [&](ll k, int s) {
		int res = s;
		REP(i, 60) if (k >> i & 1) res = dp[i][res];
		return res;
	};
	
	puts([&]() -> bool {
		int s = 0;
		A.emplace_back(A.back() + 1);
		for (int i = K - 1; i >= 0; --i) s = move(A[i + 1] - A[i], s) | 1;
		s = move(A[0] - 1, s);
		return ~s & 1;
	}() ? "Yes": "No");
}