#include <bits/stdc++.h>
using namespace std;
#include <atcoder/modint>
using mint = atcoder::modint998244353;

#define rep(i, l, r) for (int i = (int)(l); i < (int)(r); i++)
#define ll long long
#define all(x) (x).begin(), (x).end()
#define siz(x) (int)x.size()

const int inf = 1e9;
const ll INF = 4e18;

template<class T> bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }

int main() {
    int N, X; cin >> N >> X;
    vector<int> A(N);
    rep(i, 0, N) cin >> A[i];
    int Y = ~X;
    for (int& a : A) a &= Y;
    
    sort(all(A));
    rep(i, 0, N-1) if (A[i] == A[i+1]) {
        cout << "No" << endl;
        return 0;
    }
    cout << "Yes" << endl;
}