#include<bits/stdc++.h>
using namespace std;

int main(){
    int n,k;
    cin>>n>>k;
    vector<int> a(n),sumv(n+1);
    for(int i=0;i<n;i++){
        cin>>a[i];
        sumv[i+1]=sumv[i]^a[i];
    }
    sort(sumv.begin(),sumv.end());
    for(int i=0;i<n;i++){
        int j=lower_bound(sumv.begin(),sumv.end(),sumv[i]^k)-sumv.begin();
        if(j<=n&&(sumv[j]^sumv[i])==k){
            cout<<"Yes"<<endl;
            return 0;
        }
    }
    cout<<"No"<<endl;
}