// Less Sweet Alchemy

#include <stdio.h>
#include <iostream>
#include <algorithm>
#include <vector>

using namespace std;

int main() {
  int N, X;

  cin >> N >> X;

  vector<int> A;

  for (int i = 0; i < N; i++) {
    int in;

    cin >> in;

    A.push_back(in - X);
  }

  sort(A.begin(), A.end());

  if ((A[0] < 0 && N > 1) || (N == 1 && A[0] == 0)) {
    cout << "Yes" << endl;
  } else {
    cout << "No" << endl;
  }

  return 0;
}