#include <bits/stdc++.h>
using namespace std;

using Int = long long;
const char newl = '\n';

template<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}
template<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}
template<typename T> void drop(const T &x){cout<<x<<endl;exit(0);}
template<typename T=Int>
vector<T> read(size_t n){
  vector<T> ts(n);
  for(size_t i=0;i<n;i++) cin>>ts[i];
  return ts;
}

//INSERT ABOVE HERE
signed main(){
  cin.tie(0);
  ios::sync_with_stdio(0);

  Int n,k;
  cin>>n>>k;
  auto as=read(k);

  Int ps[6]={};
  for(Int i=0;i<6;i++) ps[i]=-1;

  auto update=[&](Int x){
    if(x<=0) return;
    chmax(ps[x%6],x);
  };

  auto mark=[&](Int a){
    if(a<=0 or a>ps[a%6]) return;
    for(Int k=1;k<=6;k++){
      if(a-k<=0) break;
      if(a-k+1<=ps[(a-k+1)%6] and a-k+6<=ps[(a-k+6)%6]) update(a-k);
      if(a-k+2<=ps[(a-k+2)%6] and a-k+5<=ps[(a-k+5)%6]) update(a-k);
      if(a-k+3<=ps[(a-k+3)%6] and a-k+4<=ps[(a-k+4)%6]) update(a-k);
    }
  };

  // drop("Yes");

  sort(as.rbegin(),as.rend());
  for(Int a:as){
    update(a);
    for(Int k=0;k<10000;k++) mark(a-k);
    // if(1<=ps[1]) drop("No");
  }

  // for(Int i=0;i<6;i++) cout<<ps[i]<<endl;
  cout<<(1<=ps[1]?"No":"Yes")<<newl;
  return 0;
}