#include #include using ll = long long; using ull = unsigned long long; #define rep(i, n) for(int i = 0; i < (int)(n); i++) #define REP(i, m, n) for(int i = (int)(m); i < (int)(n); i++) using namespace std; using namespace atcoder; using mint = modint998244353; const int inf = 1000000007; const ll longinf = 1ll << 60; int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int n, k; cin >> n >> k; vector a(n); rep(i, n) cin >> a[i]; vector s(n + 1); rep(i, n) s[i + 1] = s[i] ^ a[i]; int m = 1 << 20; vector l(m, -1), r(m, -1); int left = -1, right = n + 1; rep(i, n + 1) { if(r[s[i]] != -1) { left = max(left, r[s[i]]); right = min(right, i); } r[s[i]] = i; if(l[s[i]] == -1) { l[s[i]] = i; } } if(left >= right) { cout << "No" << endl; return 0; } if(left == -1) { cout << "Yes" << endl; return 0; } vector ng(128, vector(14, int(0))); bool can = false; vector> p(1 << 20); rep(j, 128) rep(k, 14) { int v = j | ((1 << k) - 1) << 7; p[v] = {j, k}; } rep(i, n) { if(l[s[i]] == i) { rep(j, 128) rep(k, 14) { int v = j | ((1 << k) - 1) << 7; int ri = r[s[i] ^ v]; if(ri != -1 && i < ri) { ++ng[j][k]; } } } if(r[s[i]] == i) { rep(j, 128) rep(k, 14) { int v = j | ((1 << k) - 1) << 7; int li = l[s[i] ^ v]; if(li != -1 && li < i) { --ng[j][k]; } } } if(left <= i && i < right) { for(int j = max(1, a[i] - k); j <= a[i] + k; j++) { auto [v, c] = p[j ^ a[i]]; if(!ng[v][c]) { can = true; break; } } } } cout << (can ? "Yes" : "No") << endl; return 0; }