#include <algorithm>
#include <array>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <optional>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <vector>

using namespace std;

int main() {
    int32_t n, x;
    cin >> n >> x;
    int32_t mn = numeric_limits<int32_t>::max(),
            mx = numeric_limits<int32_t>::min();
    for (auto i = 0; i < n; ++i) {
        int32_t c;
        cin >> c;
        mn = min(mn, c);
        mx = max(mx, c);
    }
    cout << ((mn <= x && x <= mx) ? "Yes" : "No") << endl;
    return 0;
}