//#pragma GCC target("avx2")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#include <atcoder/all>
#define all(v) v.begin(),v.end()
#define eb(v) emplace_back(v)
#define mp(a,b) make_pair(a,b)
#define pc(x) std::bitset<sizeof(x) * 8>(x).count()
#define fast cin.tie(nullptr);ios_base::sync_with_stdio(false)
using namespace std;
using namespace atcoder;
using ll = long long;
using mint = modint998244353;
//using mint = modint1000000007;
using ld = long double;
using graph = vector<vector<int>>;
using wgraph = vector<vector<pair<ll, ll>>>;
constexpr ll mod = 998244353;
//constexpr ll mod = 1e9 + 7;
constexpr ll inf = 2e18;

static void judge(bool c) {
	cout << (c ? "Yes" : "No") << endl;
}

int n,x,c[100];
int main(){
	cin >> n >> x;
	for(int i = 0; i < n; i++) cin >> c[i];
	judge(x <= c[n - 1] && c[0] <= x);
}