#include <iostream> #include <algorithm> #include <iomanip> #include <vector> #include <queue> #include <deque> #include <set> #include <map> #include <tuple> #include <cmath> #include <numeric> #include <functional> #include <cassert> #define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl; #define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl; template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; } template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; } using namespace std; typedef long long ll; template<typename T> vector<vector<T>> vec2d(int n, int m, T v){ return vector<vector<T>>(n, vector<T>(m, v)); } template<typename T> vector<vector<vector<T>>> vec3d(int n, int m, int k, T v){ return vector<vector<vector<T>>>(n, vector<vector<T>>(m, vector<T>(k, v))); } template<typename T> void print_vector(vector<T> v, char delimiter=' '){ if(v.empty()) { cout << endl; return; } for(int i = 0; i+1 < v.size(); i++) cout << v[i] << delimiter; cout << v.back() << endl; } int main(){ ios::sync_with_stdio(false); cin.tie(0); cout << setprecision(10) << fixed; int n, x; cin >> n >> x; vector<int> a(n); map<int, int> idx; set<int> st; for(int i = 0; i < n; i++) { cin >> a[i]; } for(int i = 0; i < n; i++){ if(st.count(a[i]) || st.count(a[i]^x)){ cout << "No" << endl; return 0; } st.insert(a[i]); st.insert(a[i]^x); idx[a[i]] = i; idx[a[i]^x] = i; } vector<int> ans; for(int i = 0; i < n; i++){ auto a = *(st.begin()); st.erase(a); st.erase(a^x); ans.push_back(idx[a]); } for(int i = 0; i < n-1; i++){ int i0 = ans[i], i1 = ans[i+1]; if((a[i0] >= (a[i1]^x)) || ((a[i0]^x) >= a[i1])){ cout << "No" << endl; return 0; } } cout << "Yes" << endl; }