#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define elif else if
#define sp(x) fixed << setprecision(x)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
const int MOD = 1000000007;
//const int MOD = 998244353;
const int inf = (1<<30)-1;
const ll INF = (1LL<<60)-1;
const double pi = acos(-1.0);
const double EPS = 1e-10;
template<typename T> bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;};
template<typename T> bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;};

int main(){
    ll N, K;
    cin >> N >> K;
    ll A[K];
    rep(i, K) {cin >> A[i]; A[i]--;}
    bool ok[100];
    fill(ok, ok+100, true);
    rep(i, K){
        rep(j, i){
            ll d = A[i]-A[j];
            if(d == 1 || d == 3 || d == 5){
                if(A[i] >= 50) {cout << "No" << endl; return 0;} 
            }
        }
    }
    rep(i, K){
        if(A[i] < 100) ok[A[i]] = false;
    }
    rep3(i, 99, 0){
        if(!ok[i]) continue;
        rep2(j, 1, 3){
            if(i+j < 100 && i+7-j < 100 && !ok[i+j] && !ok[i+7-j]) ok[i] = false; 
        }
    }
    cout << (ok[0]? "Yes" : "No") << endl;
}