#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)n;i++)
int pow3(int x){
    int res=1;
    while(x--)res*=3;
    return res;
}

//作れる値:+も-も1つ以上含まれる or ただ1つの+からなる

//s:+も-も含む t:+のみ(1つ以上) u:-のみ(1つ以上)
void solve(vector<long long> a,vector<long long> &s,vector<long long> &t,vector<long long> &u){
    rep(i,pow3(a.size())){
        int j=i;
        long long now=0;
        int cntp=0,cntm=0;
        rep(k,a.size()){
            if(j%3==1)now+=a[k],cntp++;
            else if(j%3==2)now-=a[k],cntm++;
            j/=3;
        }
        if(cntp && cntm)s.emplace_back(now);
        else if(cntp)t.emplace_back(now);
        else if(cntm)u.emplace_back(now);
    }
    return;
}

const pair<int,int> idx[]={{0,0},{0,1},{0,2},{0,3},{1,0},{1,2},{2,0},{2,1},{3,0}};

int main(){
    //std::ios::sync_with_stdio(false);
    //std::cin.tie(nullptr);
    std::cout.precision(10);
/*------------------------------------*/
    
    int n;
    long long k;
    cin >> n >> k;
    assert(1<=n && n<=20);
    assert(-(long long)1e9<=k && k<=(long long)1e9);

    vector<long long> a(n/2),b(n-n/2);
    rep(i,n/2)cin >> a[i],assert(-(long long)1e9<=a[i] && a[i]<=(long long)1e9);
    rep(i,n-n/2)cin >> b[i],assert(-(long long)1e9<=b[i] && b[i]<=(long long)1e9);
    vector<long long> res1[4],res2[4];
    solve(a,res1[0],res1[1],res1[2]);
    solve(b,res2[0],res2[1],res2[2]);

    res1[3]={0};
    res2[3]={0};

    rep(i,4)res2[i].emplace_back(1e18);
    bool ok=false;
    for(auto [i,j]:idx){
        for(auto x:res1[i]){
            if(*lower_bound(res2[j].begin(),res2[j].end(),k-x) == k-x)ok=true;
        }
    }
    for(auto x:a)if(x==k)ok=true;
    for(auto x:b)if(x==k)ok=true;
    cout << (ok ? "Yes" : "No") << endl;
}