#include<stdio.h>
int h[100005], l;
int comp_h(int a, int b)
{
	if (h[a] > h[b])
		return 1;
	else
		return -1;
}
void swap_h(int a, int b)
{
	int f = h[a];
	h[a] = h[b];
	h[b] = f;
	return;
}
void push(int ne)
{
	h[l] = ne;
	int p = l;
	l++;
	for (; p > 0; p = (p - 1) / 2)
		if (comp_h((p - 1) / 2, p) > 0)
			swap_h((p - 1) / 2, p);
	return;
}
int pop()
{
	l--;
	swap_h(0, l);
	int p = 0;
	for (;;)
	{
		if (2 * p + 2 < l)
		{
			if (comp_h(2 * p + 1, 2 * p + 2) > 0)
			{
				if (comp_h(p, 2 * p + 2) > 0)
					swap_h(p, 2 * p + 2);
				p = 2 * p + 2;
			}
			else
			{
				if (comp_h(p, 2 * p + 1) > 0)
					swap_h(p, 2 * p + 1);
				p = 2 * p + 1;
			}
		}
		else if (2 * p + 1 < l)
		{
			if (comp_h(p, 2 * p + 1) > 0)
				swap_h(p, 2 * p + 1);
			p = 2 * p + 1;
		}
		else
			break;
	}
	return h[l];
}
int main()
{
	int n, k;
	scanf("%d %d", &n, &k);
	int i;
	int a[100005];
	for (i = 0; i < n; i++)
		scanf("%d", &a[i]);
	int b[100005];
	b[0] = 0;
	for (i = 0; i < n; i++)
		b[i + 1] = (b[i] ^ a[i]);
	l = 0;
	for (i = 0; i <= n; i++)
		push(b[i]);
	for (i = 0; i <= n; i++)
		b[i] = pop();
	int min, mid, max;
	b[n + 1] = -1;
	for (i = 0; i < n; i++)
	{
		min = -1;
		max = n + 1;
		while (max - min > 1)
		{
			mid = (max + min) / 2;
			if (b[mid] < (k ^ b[i]))
				min = mid;
			else
				max = mid;
		}
		if (i == max)
			max++;
		if ((b[i] ^ b[max]) == k)
		{
			printf("Yes\n");
			return 0;
		}
	}
	printf("No\n");
	return 0;
}