#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#define popcount __builtin_popcount
using namespace std;
using ll=long long;
typedef pair<int, ll> P;

int main()
{
    ll n;
    int k; cin>>n>>k;
    ll a[101];
    for(int i=0; i<k; i++){
        cin>>a[i];
    }
    for(int i=0; i<k; i++){
        for(int j=0; j<i; j++){
            ll d=a[i]-a[j];
            if(d==1 || d==3 || d==5){
                if(a[i]>100){
                    cout<<"No"<<endl;
                    return 0;
                }
            }
        }
    }
    bool myon[102]={};
    for(int i=0; i<k; i++){
        if(a[i]<=100) myon[a[i]]=1;
    }
    for(int i=100; i>0; i--){
        if(!myon[i]) continue;
        if(i-6>=0 && myon[i-5]) myon[i-6]=1;
        if(i-4>=0 && myon[i-1]) myon[i-4]=1;
        if(i-5>=0 && myon[i-3]) myon[i-5]=1;
    }
    if(myon[0]) cout<<"No"<<endl;
    else cout<<"Yes"<<endl;
    return 0;
}