#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pdd = pair<double, double>;
using pll = pair<ll, ll>;
using pli = pair<ll, int>;
using pil = pair<int, ll>;
template <typename T>
using Graph = vector<vector<T>>;
const int MOD = 1e9 + 7;
const ld PI = acos(-1);

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);

    int N, K;
    cin >> N >> K;
    vector<int> A(N);
    for (int i = 0; i < N; ++i) {
        cin >> A[i];
    }

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

    vector<ll> v11, v12, v13, v21, v22, v23;
    int N1 = N / 2, N2 = N - N1;
    for (int i = 0; i < (1 << N1); ++i) {
        for (int j = i;; j = (j - 1) & i) {
            int a = i & j;
            int b = i ^ j;
            ll tmp = 0;
            for (int k = 0; k < N1; ++k) {
                if (!((i >> k) & 1))
                    continue;
                tmp += ((a >> k) & 1 ? A[k] : -A[k]);
            }
            v11.emplace_back(tmp);
            if (__builtin_popcount(a) != 0) {
                v13.emplace_back(tmp);
                if (__builtin_popcount(b) != 0)
                    v12.emplace_back(tmp);
            }
            if (j == 0)
                break;
        }
    }

    for (int i = 0; i < (1 << N2); ++i) {
        for (int j = i;; j = (j - 1) & i) {
            int a = i & j;
            int b = i ^ j;
            ll tmp = 0;
            for (int k = 0; k < N2; ++k) {
                if (!((i >> k) & 1))
                    continue;
                tmp += ((a >> k) & 1 ? A[k + N1] : -A[k + N1]);
            }
            v21.emplace_back(tmp);
            if (__builtin_popcount(b) != 0) {
                v23.emplace_back(tmp);
                if (__builtin_popcount(a) != 0)
                    v22.emplace_back(tmp);
            }
            if (j == 0)
                break;
        }
    }

    sort(v12.begin(), v12.end());
    sort(v22.begin(), v22.end());
    sort(v23.begin(), v23.end());
    for (auto i : v11) {
        auto itr = lower_bound(v22.begin(), v22.end(), K - i);
        if (itr != v22.end() && *itr == K - i) {
            cout << "Yes" << endl;
            return 0;
        }
    }
    for (auto i : v21) {
        auto itr = lower_bound(v12.begin(), v12.end(), K - i);
        if (itr != v12.end() && *itr == K - i) {
            cout << "Yes" << endl;
            return 0;
        }
    }
    for (auto i : v13) {
        {
            auto itr = lower_bound(v23.begin(), v23.end(), K - i);
            if (itr != v23.end() && *itr == K - i) {
                cout << "Yes" << endl;
                return 0;
            }
        }
        {
            auto itr = lower_bound(v23.begin(), v23.end(), -K - i);
            if (itr != v23.end() && *itr == K - i) {
                cout << "Yes" << endl;
                return 0;
            }
        }
    }
    cout << "No" << endl;

    return 0;
}