#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; //using namespace atcoder; #define REP(i, n) for (int i=0; i<(n); ++i) #define RREP(i, n) for (int i=(int)(n)-1; i>=0; --i) #define FOR(i, a, n) for (int i=(a); i<(n); ++i) #define RFOR(i, a, n) for (int i=(int)(n)-1; i>=(a); --i) #define SZ(x) ((int)(x).size()) #define ALL(x) (x).begin(),(x).end() #define DUMP(x) cerr<<#x<<" = "<<(x)< ostream &operator<<(ostream &os, const vector &v) { os << "["; REP(i, SZ(v)) { if (i) os << ", "; os << v[i]; } return os << "]"; } template ostream &operator<<(ostream &os, const pair &p) { return os << "(" << p.first << " " << p.second << ")"; } template bool chmax(T &a, const T &b) { if (a < b) { a = b; return true; } return false; } template bool chmin(T &a, const T &b) { if (b < a) { a = b; return true; } return false; } using ll = long long; using ull = unsigned long long; using ld = long double; using P = pair; using vi = vector; using vll = vector; using vvi = vector; using vvll = vector; const ll MOD = 1e9 + 7; const int INF = INT_MAX / 2; const ll LINF = LLONG_MAX / 2; const ld eps = 1e-9; // edit void solve() { ll N, K; cin >> N >> K; vector A(K + 1); REP(i, K) cin >> A[i + 1]; REP(i, K) A[i + 1]--; A.push_back(N - 1); // vector B; // B.push_back(0); // for (int i = 1; i < A.size(); ++i) { // B.push_back(A[i] - A[i - 1]); // } // int COEF = 216; // int T = 216; // for (int i = 0; i < B.size(); ++i) { // if (B[i] > COEF) { // B[i] %= T; // if (B[i] == 0) B[i] = COEF; // } // } vector C = A; set cset(C.begin(), C.end()); int COEF = 1000; for (int i = 0; i < C.size(); ++i) { if (C[i] < COEF) continue; for (int x = 2; x <= 6; x += 2) { if (cset.count(C[i] + x)) { cout << "No" << endl; return; } } } // C.push_back(0); // for (int i = 1; i < B.size(); ++i) { // C.push_back(C.back() + B[i]); // } vector good(COEF + 10, true); for (int i = 1; i + 1 < C.size() && C[i] < COEF; ++i) { good[C[i]] = false; } for (int i = COEF - 1; i >= 0; --i) { if (!good[i]) continue; int now = i; for (int x = 1; x <= 3; ++x) { int y = 7 - x; if (!good[now + x] && !good[now + y]) { good[now] = false; } } } if (good[0]) { cout << "Yes" << endl; } else { cout << "No" << endl; } // cout << C << endl; } int main() { cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(10); // std::ifstream in("input.txt"); // std::cin.rdbuf(in.rdbuf()); solve(); return 0; }