#pragma GCC optimize("O2")
#include <algorithm>
#include <array>
#include <bit>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfenv>
#include <cfloat>
#include <chrono>
#include <cinttypes>
#include <climits>
#include <cmath>
#include <compare>
#include <complex>
#include <concepts>
#include <cstdarg>
#include <cstddef>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <initializer_list>
#include <iomanip>
#include <ios>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <memory>
#include <new>
#include <numbers>
#include <numeric>
#include <ostream>
#include <queue>
#include <random>
#include <ranges>
#include <set>
#include <span>
#include <sstream>
#include <stack>
#include <streambuf>
#include <string>
#include <tuple>
#include <type_traits>
#include <variant>

//#define int ll
#define INT128_MAX (__int128)(((unsigned __int128) 1 << ((sizeof(__int128) * __CHAR_BIT__) - 1)) - 1)
#define INT128_MIN (-INT128_MAX - 1)

#define clock chrono::steady_clock::now().time_since_epoch().count()

#ifdef DEBUG
#define dbg(x) cout << (#x) << " = " << x << '\n'
#else
#define dbg(x)
#endif

namespace R = std::ranges;
namespace V = std::views;

using namespace std;

using ll = long long;
using ull = unsigned long long;
using ldb = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
//#define double ldb

template<class T>
ostream& operator<<(ostream& os, const pair<T, T> pr) {
  return os << pr.first << ' ' << pr.second;
}
template<class T, size_t N>
ostream& operator<<(ostream& os, const array<T, N> &arr) {
  for(const T &X : arr)
    os << X << ' ';
  return os;
}
template<class T>
ostream& operator<<(ostream& os, const vector<T> &vec) {
  for(const T &X : vec)
    os << X << ' ';
  return os;
}
template<class T>
ostream& operator<<(ostream& os, const set<T> &s) {
  for(const T &x : s)
    os << x << ' ';
  return os;
}


signed main() {
  ios::sync_with_stdio(false), cin.tie(NULL);

  int n, k; cin >> n >> k;
  vector<int> a(n + 1);
  for(int &x : a | V::drop(1))
    cin >> x;

  vector<int> b = a;
  for(int i = 1; i <= n; i++)
    b[i] ^= b[i - 1];

  int l = 0;
  {
    bitset<1 << 20> vis = {};
    vis[b[0]] = true;
    while(l + 1 <= n and !vis[b[l + 1]])
      vis[b[l + 1]] = true, l += 1;
  }

  int r = n;
  {
    bitset<1 << 20> vis = {};
    vis[b[n]] = true;
    while(r > 0 and !vis[b[r - 1]])
      vis[b[r - 1]] = true, r -= 1;
  }


  vector<int> cand;
  {
    bitset<1 << 21> bs = {};
    for(int i = 1; i <= 1000000; i++)
      for(int j = max(i - 100, 1); j <= i + 100; j++)
        bs[i ^ j] = true;
    for(int i = 0; i < (1 << 21); i++)
      if (bs[i])
        cand.emplace_back(i);
  }

  bool ans = false;
  for(int x : cand) {
    int lcnt[1 << 20] = {}, rcnt[1 << 20] = {};
    for(int x : b) lcnt[x]++;
    if (*max_element(lcnt, lcnt + (1 << 20)) <= 1)
      ans = true;
    int count = 0;
    for(int i = n; i >= r; i--) {
      lcnt[b[i]]--;
      count -= rcnt[b[i]];
      rcnt[b[i] ^ x]++;
      count += lcnt[b[i] ^ x];
      if (i <= l + 1 and a[i] != x and abs((a[i] ^ x) - a[i]) <= k and count == 0)
        ans = true;
    }
  }

  cout << (ans ? "Yes\n" : "No\n");

  return 0;
}