int n , m;
cin >> n >> m ;
multiset< int > s ;
int c ;
for(int i=1;i<=n;i++){
    cin >> c ;
    s.insert(c);
}
int flag = 1 ;

while(!s.empty()){
       if(s.find(m)!=s.end()){
       cout << "YES" << "n";  // if m is found break
       flag = 0;
       break;
    }
    else{
        auto it = --s.end() ;
        if(*it < m) m = m - *it ;
        s.erase(it); // to earse last element
         }
    }
if(flag) cout << "NO" << "n";