/* -*- coding: utf-8 -*-
 *
 * 1538.cc:  No.1538 引きこもりさんは引き算が得意。 - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 20;
const int MAX_M = 59049; // = 3^10

/* typedef */

typedef long long ll;
typedef pair<ll,int> pli;

/* global variables */

int as[MAX_N];
pli ass[MAX_M], bss[MAX_M];

/* subroutines */

inline int exp3(int n) {
  int e = 1;
  while (n--) e *= 3;
  return e;
}

inline pli t2sum(int t, int l, int r) {
  ll sum = 0;
  int b = 0;
  for (int i = l; i < r; i++, t /= 3) {
    int d = t % 3;
    if (d == 1) sum += as[i], b |= 1;
    else if (d == 2) sum -= as[i], b |= 2;
  }
  return pli(sum, b);
}

/* main */

int main() {
  int n, k;
  scanf("%d%d", &n, &k);
  for (int i = 0; i < n; i++) {
    scanf("%d", as + i);
    if (as[i] == k) { puts("Yes"); return 0; }
  }

  int a = n / 2, b = n - a;
  int am = exp3(a), bm = exp3(b);

  for (int ts = 0; ts < am; ts++) ass[ts] = t2sum(ts, 0, a);
  sort(ass, ass + am);
  am = unique(ass, ass + am) - ass;

  for (int ts = 0; ts < bm; ts++) bss[ts] = t2sum(ts, a, n);
  sort(bss, bss + bm);
  bm = unique(bss, bss + bm) - bss;

  for (int ts = 0; ts < am; ts++) {
    pli pa = ass[ts];
    //printf("%d -> %lld\n", ts, sum);

    int i = lower_bound(bss, bss + bm, pli(k - pa.first, 0)) - bss;
    while (i < bm && bss[i].first + pa.first == k) {
      if ((bss[i].second | pa.second) == 3) {
	puts("Yes"); return 0;
      }
      i++;
    }
  }

  puts("No");
  return 0;
}