#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for (int i = 0; i < n; i++)
#define rrep(i,n) for (int i = n-1; i >= 0; i--)
#define rep2(i,a,b) for (int i = a; i < b; i++)
#define rrep2(i,a,b) for (int i = a-1; i >= b; i--)
#define rep3(i,a,b,c) for (int i = a; i < b; i+=c)
#define rrep3(i,a,b,c) for (int i = a-1; i >= b; i-=c)
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
template<class T> bool chmax(T &a, T b){if (a < b){a = b;return true;} else return false;}
template<class T> bool chmin(T &a, T b){if (a > b){a = b;return true;} else return false;}

int n,x,P[200010],Q[200010];
bool flag[200010];
int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cin>>n>>x;
    vector<tuple<int,int,int>>vp;
    rep(i,n){
        int a;cin>>a;
        vp.push_back(make_tuple(a,0,i));
        vp.push_back(make_tuple(a^x,1,i));
    }
    sort(all(vp));
    int at=0;
    for(auto[s,t,i]:vp){
        if(flag[i])continue;
        flag[i]=true;
        if(t==0){
            if(at%2==0){
                P[at]=s;
                Q[at]=x^s;
            }
            else{
                Q[at]=s;
                P[at]=x^s;
            }
        }else{
            if(at%2==1){
                P[at]=s;
                Q[at]=x^s;
            }
            else{
                Q[at]=s;
                P[at]=x^s;
            }
        }
        at++;
    }
    rep(i,n-1){
        if(P[i]>=P[i+1]||Q[i]>=Q[i+1]){
            cout<<"No"<<"\n";
            return 0;
        }
    }
    cout<<"Yes"<<"\n";
}