#define rep(i, n) for (int i = 0; i < (int)(n); i++) #define ALL(v) v.begin(), v.end() typedef long long ll; #include <bits/stdc++.h> using namespace std; int main(){ int n,x; cin>>n>>x; vector<int> A(n); rep(i,n) cin>>A[i]; sort(ALL(A)); if(x>=A[0] && x<=A[n-1]) cout<<"Yes"<<endl; else cout<<"No"<<endl; return 0; }