#include <bits/stdc++.h>
using namespace std;
int main(){
  long long N;
  int K;
  cin >> N >> K;
  vector<long long> A(K);
  for (int i = 0; i < K; i++){
    cin >> A[i];
    A[i]--;
  }
  vector<long long> B;
  B.push_back(0);
  for (int i = 0; i < K; i++){
    B.push_back(A[i]);
  }
  B.push_back(N - 1);
  for (int i = 0; i < K + 1; i++){
    long long d = B[i + 1] - B[i];
    if (d > 10){
      for (int j = i + 1; j < K + 2; j++){
        B[j] -= d - 10;
      }
    }
  }
  N = B[K + 1];
  vector<bool> g(N, false);
  for (int i = 0; i < K; i++){
    g[B[i + 1]] = true;
  }
  vector<bool> dp(N + 6, true);
  for (int i = N - 1; i >= 0; i--){
    if (g[i]){
      dp[i] = false;
    }
    if (!dp[i + 1] && !dp[i + 6]){
      dp[i] = false;
    }
    if (!dp[i + 2] && !dp[i + 5]){
      dp[i] = false;
    }
    if (!dp[i + 3] && !dp[i + 4]){
      dp[i] = false;
    }
  }
  if (dp[0]){
    cout << "Yes" << endl;
  } else {
    cout << "No" << endl;
  }
}