#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, s, e) for (int i = (int)(s); i < (int)(e); ++i)
#define all(a) (a).begin(),(a).end()

int main() {
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    
    int N;
    ll K;
    cin >> N >> K;
    vector<ll> A(N);
    rep(i, 0, N) cin >> A[i];
    rep(i, 1, N) A[i] ^= A[i - 1];
    
    set<ll> s;
    s.insert(0);
    bool find = false;
    rep(i, 0, N) {
        if (s.count(A[i] ^ K)) find = true;
        s.insert(A[i]);
    }
    
    cout << (find ? "Yes\n" : "No\n");
}