// #pragma GCC optimize ("Ofast")
// #pragma GCC optimize ("unroll-loops")
// #pragma GCC target ("avx,avx2,fma")
#include <bits/stdc++.h>

using std::cin, std::cout, std::cerr;
using ll = long long;

std::vector<int> Mul(std::vector<int> a, std::vector<int> b) {
    std::vector<int> c(1 << 6);
    for(int i = 0; i < 1 << 6; i ++)
        c[i] = b[a[i]];
    return c;
}

std::vector<int> Pow(std::vector<int> a, int b) {
    std::vector<int> r(1 << 6);
    std::iota(r.begin(), r.end(), 0);
    for(; b; b /= 2) {
        if(b & 1)
            r = Mul(r, a);
        a = Mul(a, a);
    }
    return r;
}

int main() {
    std::ios::sync_with_stdio(false);
    ll n; int k; cin >> n >> k;
    std::vector<ll> a(k);
    for(int i = 0; i < k; i ++)
        cin >> a[i];
    
    std::vector<int> p(1 << 6);
    for(int k = 0; k < (1 << 6); k ++) {
        int x = 0;
        for(int i = 1; i <= 3; i ++)
            if(((k >> (i - 1)) & 1) && ((k >> (7 - i - 1)) & 1))
                x = 1;
        p[k] = ((k & ~(1 << 5)) << 1) + x;
    }

    int t = 0;
    ll cur = n;
    std::ranges::reverse(a);
    for(ll x : a) {
        t = Pow(p, cur - x)[t];
        cur = x;
        t |= 1;
    }
    t = Pow(p, cur - 1)[t];
    cout << ((t & 1) ? "No" : "Yes") << '\n';
}