/**
 *   @FileName	a.cpp
 *   @Author	kanpurin
 *   @Created	2021.04.01 02:18:14
**/

#include "bits/stdc++.h" 
using namespace std; 
typedef long long ll;

int main() {
    unordered_map<int,int> mp;
    mp[0]++;
    int n,k;cin >> n >> k;
    int x = 0;
    ll ans = 0;
    for (int i = 0; i < n; i++) {
        int a;cin >> a;
        x ^= a;
        if (mp.find(x^k) != mp.end()) {
            ans += mp[x^k];
        }
        mp[x]++;
    }
    if (ans >= 1) {
        puts("Yes");
    }
    else {
        puts("No");
    }
    return 0;
}