#include <bits/stdc++.h>
// clang-format off
using namespace std; using ll=long long; using ull=unsigned long long; using pll=pair<ll,ll>; const ll INF=4e18;
void print0(){}; template<typename H,typename... T> void print0(H h,T... t){cout<<h;print0(t...);}
void print(){print0("\n");}; template<typename H,typename... T>void print(H h,T... t){print0(h);if(sizeof...(T)>0)print0(" ");print(t...);}
void perr0(){}; template<typename H,typename... T> void perr0(H h,T... t){cerr<<h;perr0(t...);}
void perr(){perr0("\n");}; template<typename H,typename... T>void perr(H h,T... t){perr0(h);if(sizeof...(T)>0)perr0(" ");perr(t...);}
void ioinit() { cout<<fixed<<setprecision(15); cerr<<fixed<<setprecision(6); ios_base::sync_with_stdio(0); cin.tie(0); }
// clang-format on

// クイックソート
mt19937 engine(2021);
ll X;
ll randint(ll mn, ll mx) {
    ll rng = mx - mn + 1;
    return mn + (engine() % rng);
}
bool gt(ll a, ll b) {
    if (a < (b ^ X) && (a ^ X) < b) {
        return true;
    }
    if (a < b && (a ^ X) < (b ^ X)) {
        return true;
    }
    return false;
}
void myqsort(vector<ll>& A) {
    if (A.size() <= 1) {
        return;
    }
    ll n = A.size();
    ll k = randint(0, n - 1);
    ll base = A[k];
    vector<ll> large;
    vector<ll> small;
    for (ll i = 0; i < n; i++) {
        if (i == k) continue;
        if (gt(base, A[i])) {
            large.push_back(A[i]);
        } else if (gt(A[i], base)) {
            small.push_back(A[i]);
        } else {
            print("No");
            exit(0);
        }
    }
    myqsort(large);
    myqsort(small);
}
int main() {
    ioinit();
    ll N;
    cin >> N >> X;
    vector<ll> A(N);
    for (ll i = 0; i < N; i++) {
        cin >> A[i];
    }
    myqsort(A);
    print("Yes");
    return 0;
}