伊甸之花（模拟）--牛客小白月赛89-A

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
#define inf 0x3f3f3f3f
const int mod=1e9+7;
const int N=1e6+5;
int n,m;
int a[N];
void solve(){
	cin>>n>>m;
	int maxx=0,minn=inf;
	for(int i=1;i<=n;i++){
		cin>>a[i];
		maxx=max(maxx,a[i]);
		minn=min(minn,a[i]);
	}
	if(maxx==m&&minn==1) cout<<"No";
	else cout<<"Yes";
}
signed main(){
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);
	int tt=1;
//	cin>>tt;
	while(tt--) solve();
	return 0;
}