#include <bits/stdc++.h>
#define NIL (-1)
#define ll long long
using namespace std;
const int64_t MOD = 1e9 + 7;
const int INF = INT_MAX;
const double PI = acos(-1.0);

int main() {
	int N, K;
	cin >> N >> K;

	vector<int> A(N);
	set<int> s;
	s.insert(0);
	bool b = 0;
	for (int i = 0; i < N; i++) {
		int n;
		cin >> n;
		if (!i) A[i] = n;
		else A[i] = n ^ A[i - 1];
		s.insert(A[i]);
		//cout << A[i] << endl;
		if (s.find(A[i] ^ K) != s.end()) b = 1;
	}
	cout << (b ? "Yes" : "No") << endl;
}