#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using ld = long double;

int main(){
    cin.tie(0);
    ios::sync_with_stdio(0);
    
    ll N,K; cin >> N >> K;
    vector<ll> A(N);
    rep(i,N) cin >> A[i];

    int N0 = N / 2, N1 = N - N / 2;
    vector<ll> A0, A1;
    rep(i,N0) A0.push_back(A[i]);
    rep(i,N1) A1.push_back(A[i + N0]);

    set<tuple<ll,int,int>> st0;
    rep(S,1<<N0) for(int T = S; ; T = (T - 1) & S) {
        int P = 0, M = 0;
        ll SUM = 0;
        rep(i,N0) {
            if(S & (1 << i)) {
                if(T & (1 << i)) {
                    SUM += A0[i];
                    P |= 1;
                } else {
                    SUM -= A0[i];
                    M |= 1;
                }
            }
        }
        st0.insert({SUM, P, M});
        if(T == 0) break;
    }

    rep(S,1<<N1) for(int T = S; ; T = (T - 1) & S) {
        int P = 0, M = 0;
        ll SUM =0;
        rep(i,N1) {
            if(S & (1 << i)) {
                if(T & (1 << i)) {
                    SUM += A1[i];
                    P |= 1;
                } else {
                    SUM -= A1[i];
                    M |= 1;
                }
            }
        }
        for(int p = 1 - P; p <= 1; p++)
            for(int m = 1 - M; m <= 1; m++)
                if(st0.count({K - SUM, p, m})) {
                    cout << "Yes" << endl;
                    return 0;
                }
        if(T == 0) break;
    }

    cout << "No" << endl;
}