#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)

void solve() {
    ll n, x;
    cin >> n >> x;
    vector<ll> c(n);
    rep(i, 0, n) cin >> c[i];
    rep(i, 0, n) c[i] -= x;
    bool pos = false, neg = false;
    rep(i, 0, n) {
        if(c[i] < 0) neg = true;
        if(c[i] > 0) pos = true; 
    }
    if(neg && pos) cout << "Yes\n";
    else cout << "No\n";
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    solve();
    return 0;
}