#include<bits/stdc++.h>
#define ll long long
#define vi vector<int>
#define vll vector<long long>
#define all(x) x.begin(),x.end()
#define rep(i,a,b) for(int i=a;i<b;i++)
#define F first
#define S second
#define endl "\n"
#define FAST  ios_base::sync_with_stdio(false);cin.tie(NULL)
#define pb push_back
#define deb(x) cout<<#x<<" "<<x<<endl;
#define sz(a) (int)a.size()
#define Q(x) for(int i=0;i<x;i++)
#define show(x) cout<<#x<<" ";for(auto i:x)cout<<i<<" ";cout<<endl;
// ctrl + shift + q -- stop execution
// use brackets after modulo operation
//if ((i & (1 << j) ) == 0) and if(i & (i << j) == 0) are different
const ll mod = 1e9 + 7;
using namespace std;


/*void solve() {

}*/
int main()
{
#ifndef ONLINE_JUDGE
	freopen("input.txt", "r", stdin);
	freopen("output.txt", "w", stdout);
#endif
	/*int t;
	cin >> t;
	while (t--) {
		solve();
	}*/
	ll n, x;
	cin >> n >> x;
	vll a(n);
	rep(i, 0, n)cin >> a[i];
	rep(i, 0, n) {
		if (a[i] != x)cout << a[i] << " ";
	}

	return 0;
}
#include <bits/stdc++.h>
#define int long long

using namespace std;

void fastIO() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.tie(nullptr);
}

void test_case() {
  int a, b, c;
  cin >> a >> b >> c;
  if (a * 2 == b + c || b * 2 == a + c || c * 2 == a + b)
    cout << "Yes\n";
  else cout << "No\n";
}

void solve() {
  int T = 1;
  for (int tc = 0; tc < T; ++tc)
    test_case();
}

int32_t main() {
  fastIO();
  solve();
  return 0;
}
