#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define ALL(v) v.begin(),v.end()
typedef long long ll;
 
#include<bits/stdc++.h>
using namespace std;
 
int main(){
  ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  
  int n,x;
  cin>>n>>x;
  vector<int> A(n);
  rep(i,n) cin>>A[i];
  vector<pair<int,int>> B(n);
  rep(i,n) B[i]={A[i]-(A[i]&x),i};
  sort(ALL(B));
  vector<int> C(n),D(n);
  rep(i,n){
    if(i%2==0) C[i]=A[B[i].second],D[i]=(A[B[i].second]^x);
    else C[i]=(A[B[i].second]^x),D[i]=A[B[i].second];
  }
  bool b=true;
  rep(i,n-1){
    if(C[i]>=C[i+1]) b=false;
    if(D[i]>=D[i+1]) b=false;
  }
  if(b) cout<<"Yes"<<endl;
  else cout<<"No"<<endl;
  
  
  
    
  return 0;
}