#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define mp make_pair
#define si(x) int(x.size())
const int mod=1000000007,MAX=200005,INF=1<<30;

int main(){
    
    std::ifstream in("text.txt");
    std::cin.rdbuf(in.rdbuf());
    cin.tie(0);
    ios::sync_with_stdio(false);
    
    ll N,K;cin>>N>>K;
    vector<ll> A(K);
    for(int i=0;i<K;i++) cin>>A[i];
    
    vector<int> cnt(6);
    
    for(int i=K-1;i>=0;i--){
        for(int x=0;x<6;x++){
            int y=(x+6-(A[i]%6))%6;
            if(cnt[x]){
                if(y==1) cnt[(A[i]+3)%6]=1;
                if(y==3) cnt[(A[i]+4)%6]=1;
                if(y==5) cnt[(A[i]+2)%6]=1;
            }
        }
        for(int j=i+1;j<K;j++){
            if(A[j]-A[i]==1){
                cnt[A[i]%6]=1;
                cnt[A[j]%6]=1;
                cnt[(A[i]+3)%6]=1;
            }
            if(A[j]-A[i]==3){
                cnt[A[i]%6]=1;
                cnt[A[j]%6]=1;
                cnt[(A[i]+4)%6]=1;
            }
            if(A[j]-A[i]==5){
                cnt[A[i]%6]=1;
                cnt[A[j]%6]=1;
                cnt[(A[i]+2)%6]=1;
            }
        }
    }
    
    if(!cnt[0]) cout<<"Yes"<<endl;
    else cout<<"No"<<endl;
}