#include <iostream>
#include <stdio.h>
#include <vector>
#include <map>
#include <utility>
#include <list>
#include <algorithm>
typedef long long ll;
const ll INF=20000;
using namespace std;

int main(){
    ll n,x;
    cin>>n>>x;
    ll ans=0;
    vector<ll> C(n);
    for(int i=0;i<n;i++)
    {
        cin>>C[i];
    }
    sort(C.begin(),C.end());
    ll right=C[n-1];
    ll left=C[0];
    ll mid;
    for(int i=n-1;i>0;i--)
    {
       mid=(right+left)/2;
       if(mid<x)
       {
           mid=left;
       }
       else if(mid>x)
       {
           mid=right;
       }
  //  cout<<mid<<endl;
    }
    if(mid>=x)cout<<"Yes"<<endl;
    else cout<<"No"<<endl;
    /*
    vector<vector<true>> dp(n+1,vector<ll>101,false);
    dp[0][0]=true;
    for(int k=0;k<=101;k++)
    {
        for(int i=0;i<=n;i++)
        {
            for(int j=0;j<=100;j++)
            {
             dp[i][j]=dp[i-1][j-C[k]]
             }      
         }
    }
    */       
    return 0;
}