#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < int(n); i++)
using ll = long long;
using P = pair<int, int>;

int main() {
    cin.tie(0);
    ios_base::sync_with_stdio(false);
    
    int n, k; cin >> n >> k;
    vector<int> a(n);
    rep(i, n) cin >> a[i];
    vector<int> sum(n + 1, 0);
    rep(i, n) sum[i + 1] = sum[i] ^ a[i];
    map<int, int> mp;
    rep(i, n + 1) mp[sum[i]] = 1;
    rep(i, n + 1) {
        if (mp[sum[i] ^ k]) {
            cout << "Yes" << endl;
            return 0;
        }
    }
    cout << "No" << endl;
    return 0;
}