#include <algorithm>
#include <atcoder/all>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int, int>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define vvpii vector<vector<pair<int, int>>>
#define vvpll vector<vector<pair<ll, ll>>>

template <typename T>
void debug(T e) {
    cerr << e << endl;
}

template <typename T>
void debug(vector<T> &v) {
    rep(i, v.size()) { cerr << v[i] << " "; }
    cerr << endl;
}

template <typename T>
void debug(vector<vector<T>> &v) {
    rep(i, v.size()) {
        rep(j, v[i].size()) { cerr << v[i][j] << " "; }
        cerr << endl;
    }
}

template <typename T>
void debug(vector<pair<T, T>> &v) {
    rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }
}

template <typename T>
void debug(set<T> &st) {
    for (auto itr = st.begin(); itr != st.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(multiset<T> &ms) {
    for (auto itr = ms.begin(); itr != ms.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(map<T, T> &mp) {
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
        cerr << itr->first << " " << itr->second << endl;
    }
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << H << " ";
    debug_out(T...);
}

using mint = modint998244353;

void debug_mint1(vector<mint> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        cerr << vec[i].val() << " ";
    }
    cerr << endl;
}

void debug_mint2(vector<vector<mint>> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        for (int j = 0; j < vec[i].size(); j++) {
            cerr << vec[i][j].val() << " ";
        }
        cerr << endl;
    }
}

void dfs(vector<vector<vector<ll>>> &vec, ll sum, bool has_plus, bool has_minus, vector<ll> &A, ll id, ll len){
    if (id == len){
        vec[has_plus][has_minus].push_back(sum);
        return;
    }
    dfs(vec, sum + A[id], true, has_minus, A, id + 1, len);
    dfs(vec, sum, has_plus, has_minus, A, id + 1, len);
    dfs(vec, sum - A[id], has_plus, true, A, id + 1, len);
    return;
}

int main() {
    ll N, K;
    cin >> N >> K;
    vector<ll> A(N);
    rep(i, N) cin >> A[i];

    for (ll i = 0; i < N; i++){
        if (A[i] == K){
            cout << "Yes" << endl;
            return 0;
        }
    }

    vector<vector<vector<ll>>> former(2, vector<vector<ll>>(2, vector<ll>(0)));
    vector<vector<vector<ll>>> latter(2, vector<vector<ll>>(2, vector<ll>(0)));

    dfs(former, 0, false, false, A, 0, N / 2);
    dfs(latter, 0, false, false, A, N / 2, N);

    for (ll i = 0; i < 2; i++){
        for (ll j = 0; j < 2; j++){
            sort(all(former[i][j]));
            sort(all(latter[i][j]));
        }
    }

    bool has = false;
    for (ll i = 0; i < 2; i++){
        for (ll j = 0; j < 2; j++){
            for (ll k = 0; k < 2; k++){
                for (ll l = 0; l < 2; l++){
                    if (i + k >= 1 && j + l >= 1){
                        for (ll m = 0; m < former[i][j].size(); m++){
                            ll id1 = lower_bound(all(latter[k][l]), K - former[i][j][m]) - latter[k][l].begin();
                            ll id2 = lower_bound(all(latter[k][l]), K - former[i][j][m] + 1) - latter[k][l].begin();
                            if (id1 != id2) has = true;
                        }
                    }
                }
            }
        }
    }
    cout << (has ? "Yes" : "No") << endl;
}