#include <bits/stdc++.h>
#include<iostream>
#include<map>
#include<vector>
#include <algorithm>
#include<math.h>
#include <iomanip>
#include<set>
#include <numeric>
#include<string>
using namespace std;

int main()
{
    int n, k, t = 0;
    cin >> n >> k;
    set<int> st;
    st.insert(0);
    vector<int> a(n); 
    for (int i = 0; i < n; i++) cin >> a[i];
    for (int i = 0; i < n; i++){
        t ^= a[i];
        st.insert(t);
        k ^= a[i];
        if(st.count(k)){
            cout << "Yes" << endl;
            return 0;
        }
    }
    cout << "No" << endl;
}