#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <string>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#include <deque>
#include <array>
#include <numeric>
#include <bitset>
#include <iomanip>
#include <cassert>
#include <chrono>
#include <random>
#include <limits>
#include <iterator>
#include <functional>
#include <sstream>
#include <fstream>
#include <complex>
#include <cstring>
#include <unordered_map>
using namespace std;

using ll = long long;
using P = pair<int, int>;
constexpr int INF = 1001001001;
constexpr int mod = 1000000007;
// constexpr int mod = 998244353;

template<class T>
inline bool chmax(T& x, T y){
    if(x < y){
        x = y;
        return true;
    }
    return false;
}
template<class T>
inline bool chmin(T& x, T y){
    if(x > y){
        x = y;
        return true;
    }
    return false;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    ll N;
    int K;
    cin >> N >> K;
    vector<ll> A(K);
    map<ll, int> mp;
    for(int i = 0; i < K; ++i){
        cin >> A[i];
        mp[A[i]] = 1;
    }
    if((mp[2] && mp[7]) || (mp[3] && mp[6]) || (mp[4] && mp[5])){
        cout << "No\n";
        return 0;
    }
    for(int i = 0; i + 1 < K; ++i){
        if((A[i] + 1 == A[i + 1]) && (A[i] - 1) % 4 == 0){
            cout << "No\n";
            return 0;
        }
    }
    cout << "Yes\n";

    return 0;
}