#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#include <list>
#include <atcoder/all>
#define popcount __builtin_popcount
using namespace std;
using namespace atcoder;
typedef long long ll;
typedef pair<int, int> P;
using mint=modint998244353;
int a[200020];
int main()
{
    int n, x;
    cin>>n>>x;
    map<int, int> mp;
    for(int i=0; i<n; i++) cin>>a[i];
    auto f=[&](int v)->int{
        return (x^((1<<30)-1))&v;
    };
    for(int i=0; i<n; i++){
        mp[f(a[i])]++;
    }
    for(auto p:mp){
        if(p.second!=1){
            cout<<"No"<<endl;
            return 0;
        }
    }
    sort(a, a+n, [&](int u, int v){ return f(u)<f(v);});
    for(int i=0; i<n-1; i++){
        if(a[i]>=(a[i+1]^x) || (a[i]^x)>=a[i+1]){
            cout<<"No"<<endl;
            return 0;
        }
    }
    cout<<"Yes"<<endl;
    return 0;
}