#include<iostream>
#include<vector>
#include <algorithm>

using namespace std;

using ll = long long;

int main(){
 ll n;
 int k;
 cin >> n >> k;
 vector<long long> a(k + 1 , 0);

 for(int i = 1; i <= k; i++){
  cin >> a[i];
 }
 ll mx =*max_element(a.begin() , a.end());
 vector<int> check(mx + 10 , 0);

 for(int i = 1; i <= k; i++){
  check[a[i]] = 1;
 }
 
 for(ll i = mx; i >= 0; i--){
  if(check[a[i]] == 1){
   if(check[a[i] + 5] == 1)check[a[i] - 1] = 1;
   if(check[a[i] - 5] == 1)check[a[i] - 6] = 1;
   if(check[a[i] + 3] == 1)check[a[i] + 4] = 1;
   if(check[a[i] - 3] == 1)check[a[i] - 4] = 1;
   if(check[a[i] - 3] == 1)check[a[i] - 4] = 1;
   if(check[a[i] + 1] == 1)check[a[i] - 3] = 1;
   if(check[a[i] - 1] == 1)check[a[i] - 4] = 1;
  }
 }

 if(check[1] == 1)cout << "No" << endl;
 else cout << "Yes" << endl;

return 0;

}