#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>

static const int MOD = 1000000007;
using ll = long long;
using u32 = unsigned;
using u64 = unsigned long long;
using namespace std;

template<class T> constexpr T INF = ::numeric_limits<T>::max() / 32 * 15 + 208;

int main() {
    int n, k;
    cin >> n >> k;
    int S = 0;
    set<int> s;
    s.emplace(0);
    for (int i = 0; i < n; ++i) {
        int x;
        scanf("%d", &x);
        S ^= x;
        if(s.count(S^k)) {
            puts("Yes");
            return 0;
        }
        s.emplace(S);
    }
    puts("No");
    return 0;
}