#include <iostream>
#include <vector>
#include <set>
using namespace std;
int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    long long N, K;
    cin >> N >> K;
    vector<long long> A(K);
    set<long long> s;
    for(int i = 0; i < K; i++) {
        cin >> A[i];
        s.insert(A[i]);
    }
    int flag = 0;
    for(int i = 0; i < K; i++){
        for(long long j = 1; j <= 6; j++){
            if(!s.count(A[i] - j) && A[i] - j > 0){
                long long t = A[i] - j + (7 - j);
                if(s.count(t)) s.insert(A[i] - j);
                else if(t > N) s.insert(A[i] - j);
            }
        }
    }
    int pre = -1;
    int cnt = 1;
    int m = 0;
    for(auto v: s){
        if(pre == -1){
            pre = v;
        }
        else if(v == pre + 1) cnt++;
        else cnt = 1;
        m = max(m, cnt);
        pre = v;
    }
    if(m >= 5) cout << "No" << endl;
    else cout << "Yes" << endl;
}