#include<iostream>
using namespace std;

int main()
{
	long n,m,x,a[100005];
	cin>>n>>x;
	for(long i=0;i<n;++i)
	{
		cin>>m;
		if(m!=x)
		{
			a[i]=m;
		}
		else
			a[i]=0;
	}
	for(long i=0;i<n;++i)
	{
		if(a[i]!=0)
			cout<<a[i]<<" ";
	}
	cout<<endl;
	return 0;
}
#include <stdio.h>
#include <iostream>
#include <algorithm>

using namespace std;

int main() {
	ios::sync_with_stdio(0); cin.tie(0);

	int N, check = 0;
	int num[1001] = { NULL };

	cin >> N;
	for (int i = 0; i < N; i++) {
		cin >> num[i];
	}

	sort(num, num + N);

	for (int i = 1; i < N; i++) {
		if (num[i - 1] == (num[i] - 1)) {
			continue;
		}
		else {
			check = 1;
			break;
		}
	}

	if (check == 0) {
		cout << "Yes";
	}
	else {
		cout << "No";
	}

	return 0;
}