#include <cmath>
#include <deque>
#include <algorithm>
#include <iterator>
#include <list>
#include <tuple>
#include <map>
#include <unordered_map>
#include <queue>
#include <set>
#include <unordered_set>
#include <stack>
#include <string>
#include <vector>
#include <fstream>
#include <iostream>
#include <functional>
#include <numeric>
#include <iomanip> 
#include <stdio.h>
//eolibraries
#define lnf 3999999999999999999
#define inf 999999999
#define PI 3.14159265359
#define endl "\n"
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define ll long long
#define all(c) (c).begin(),(c).end()
#define sz(c) (int)(c).size()
#define mkp(a,b) make_pair(a,b)
#define make_unique(a) sort(all(a)),a.erase(unique(all(a)),a.end())
#define rsz(a,n) a.resize(n)
#define pii pair <int,int>
#define rep(i,n) for(int i = 0 ; i < n ; i++) 
#define drep(i,n) for(int i = n-1 ; i >= 0 ; i--)
#define crep(i,x,n) for(int i = x ; i < n ; i++)
#define vi vector <int> 
#define vec(...) vector<__VA_ARGS__>
#define rsz(a,n) a.resize(n)
#define rszv(a,n,v) a.resize(n,v)
#define fcin ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
//eodefine
using namespace std;

const int max_n = 103002;

int n,k;
vi a;

int main(){
fcin;
	cin>>n>>k;	
	rep(i,n) { int x; cin>>x; a.pb(x); }

	function < set<ll>(int,int)> odo = [&](int l,int r) {
		set <ll> st;

		crep(i,l,r) {
			set <ll> nest = st;
			
			for(auto x : st) {
				nest.insert(a[i]-x);
				nest.insert(x-a[i]);
			}
			
			nest.insert(a[i]);

			st = nest;
		}

		return st;
 	};

 	set <ll> sta,stb;
 	sta = odo(0,(n+1)/2);
 	stb = odo((n+1)/2,n);
	
	function<void()> yp = [&]() {
		cout<<"Yes\n";
		exit(0);	
		return;
	};
	
	for(auto x : stb) {
		// cout<<x<<"\n";
		if(sta.find(x+k)!=sta.end()) yp();
		if(sta.find(x-k)!=sta.end()) yp();
		if(x==k) yp();
	}

	cout<<"No\n";
/*
*/
 
    return 0;   
}