import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }




void main() {
  enum LIM = 5 * 10^^3;
  auto gs = new int[LIM];
  foreach (n; 0 .. LIM) {
    bool[int] app;
    if (n == 1) {
      app[gs[0]] = true;
    }
    foreach (i; 0 .. n - 3 + 1) {
      app[gs[i] ^ gs[n - 2 - i]] = true;
      app[gs[i + 1] ^ gs[n - 3 - i]] = true;
    }
    for (int g = 0; ; ++g) {
      if (g !in app) {
        gs[n] = g;
        break;
      }
    }
  }
  debug {
    writeln("gs = ", gs[0 .. 1000]);
    writeln(gs[10] ^ gs[30] ^ gs[50]);
  }
  
  try {
    for (; ; ) {
      const N = readInt();
      const K = readLong();
      auto A = new long[N];
      foreach (i; 0 .. N) {
        A[i] = readLong();
      }
      
      long[] ds;
      ds ~= A[0] - 0 - 1;
      ds ~= (K + 1) - A[$ - 1] - 1;
      foreach (i; 0 .. N - 1) {
        ds ~= A[i + 1] - A[i] - 1;
      }
      
      bool ans;
      if (ds.maxElement < LIM) {
        int sum;
        foreach (d; ds) {
          sum ^= gs[cast(int)(d)];
        }
        ans = (sum != 0);
      } else {
        assert(false);
      }
      writeln(ans ? "Yes" : "No");
    }
  } catch (EOFException e) {
  }
}