#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <iomanip>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <cstdint>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pii;
#define MP make_pair
#define PB push_back
#define inf 1000000007
#define rep(i,n) for(int i = 0; i < (int)(n); ++i)
#define all(x) (x).begin(),(x).end()

template<typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val){
    std::fill( (T*)array, (T*)(array+N), val );
}
 
template<class T> inline bool chmax(T &a, T b){
    if(a<b){
        a = b;
        return true;
    }
    return false;
}

template<class T> inline bool chmin(T &a, T b){
    if(a>b){
        a = b;
        return true;
    }
    return false;
}
bool ng[110];
int main(){
    int k;
    int n;
    cin >> k >> n;
    vector<ll> a(n);
    rep(i,n) cin >> a[i];
    set<ll> st;
    rep(i,n){
        st.insert(a[i]);
    }
    rep(i,n){
        if(a[i]<100){
            ng[a[i]] = 1;
        }else{
            if(st.count(a[i]-1)||st.count(a[i]-3)||st.count(a[i]-5)){
                cout << "No\n";
                return 0;
            }
        }
    }
    for(int i=99;i>=0;i--){
        for(int j=1;j<=3;j++){
            if(ng[i+j]&&ng[i+7-j]){
                ng[i] = 1;
            }
        }
    }
    if(ng[1]){
        cout << "No\n";
    }else{
        cout << "Yes\n";
    }
    return 0;
}