#include <iostream>
#include <iomanip>
#include <vector>
#include <string>
#include <queue>
#include <map>
#include <set>
#include <string>
#include <algorithm>
#include <cmath>
#include <unordered_map>
#include <unordered_set>
using namespace std;

#define ll long long
#define nl endl
#define cy cout << "YES\n"
#define cn cout << "NO\n"
#define sz(s) s.size()
#define allv v.begin(), v.end()
#define cin(vec) for (int i = 0; i < n && cin >> vec[i]; i++)

void sherry()
{
    ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
#ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout);
#endif
}
int n;
ll x;
vector<ll> v;
bool rec(int i, ll sum)
{
    if (i > n)
        return 0;
    if (i == n)
    {
        return sum == x;
    }
    return rec(i + 1, sum + v[i]) || rec(i + 1, sum - v[i]);
}
void solve()
{
    cin >> n >> x;
    v = vector<ll>(n);
    cin(v);
    rec(0, 0) ? cy : cn;
}

int main()
{
    sherry();
    ll t = 1;
    // cin >> t;
    while (t--)
    {
        solve();
    }
    return 0;
}