#define MOD_TYPE 2 #pragma region Macros #include using namespace std; #if 0 #include #include using Int = boost::multiprecision::cpp_int; using lld = boost::multiprecision::cpp_dec_float_100; #endif #if 1 #pragma GCC target("avx2") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #endif using ll = long long int; using ld = long double; using pii = pair; using pll = pair; using pld = pair; template using smaller_queue = priority_queue, greater>; constexpr ll MOD = (MOD_TYPE == 1 ? (ll)(1e9 + 7) : 998244353); constexpr int INF = (int)1e9 + 10; constexpr ll LINF = (ll)4e18; constexpr ld PI = acos(-1.0); constexpr ld EPS = 1e-7; constexpr int Dx[] = {0, 0, -1, 1, -1, 1, -1, 1, 0}; constexpr int Dy[] = {1, -1, 0, 0, -1, -1, 1, 1, 0}; #define REP(i, m, n) for (ll i = m; i < (ll)(n); ++i) #define rep(i, n) REP(i, 0, n) #define REPI(i, m, n) for (int i = m; i < (int)(n); ++i) #define repi(i, n) REPI(i, 0, n) #define MP make_pair #define MT make_tuple #define YES(n) cout << ((n) ? "YES" : "NO") << "\n" #define Yes(n) cout << ((n) ? "Yes" : "No") << "\n" #define possible(n) cout << ((n) ? "possible" : "impossible") << "\n" #define Possible(n) cout << ((n) ? "Possible" : "Impossible") << "\n" #define all(v) v.begin(), v.end() #define NP(v) next_permutation(all(v)) #define dbg(x) cerr << #x << ":" << x << "\n"; struct io_init { io_init() { cin.tie(0); ios::sync_with_stdio(false); cout << setprecision(30) << setiosflags(ios::fixed); }; } io_init; template inline bool chmin(T &a, T b) { if (a > b) { a = b; return true; } return false; } template inline bool chmax(T &a, T b) { if (a < b) { a = b; return true; } return false; } inline ll CEIL(ll a, ll b) { return (a + b - 1) / b; } template inline void Fill(A (&array)[N], const T &val) { fill((T *)array, (T *)(array + N), val); } template constexpr istream &operator>>(istream &is, pair &p) noexcept { is >> p.first >> p.second; return is; } template constexpr ostream &operator<<(ostream &os, pair &p) noexcept { os << p.first << " " << p.second; return os; } #pragma endregion // -------------------------------------- void calc(vector &a, set &res, set &p, set &m) { int n = a.size(); REP(msk, 1, 1 << n) { for (int msk2 = msk; msk2 > 0; msk2 = (msk2 - 1) & msk) { ll sum = 0; rep(i, n) { if (!(msk & (1 << i))) continue; if (msk2 & (1 << i)) sum += a[i]; else sum -= a[i]; } if (msk2 == msk) p.insert(sum), m.insert(-sum); else res.insert(sum); } } } void solve() { int n; ll k; cin >> n >> k; vector a(n); vector L, R; rep(i, n) { cin >> a[i]; if (a[i] == k) { Yes(1); return; } if (i < n / 2) L.push_back(a[i]); else R.push_back(a[i]); } set X, Y, p[2], m[2]; calc(L, X, p[0], m[0]), calc(R, Y, p[1], m[1]); for (auto t : X) { if (Y.count(k - t) or p[1].count(k - t) or m[1].count(k - t)) { Yes(1); return; } } for (auto t : Y) { if (X.count(k - t) or p[0].count(k - t) or m[0].count(k - t)) { Yes(1); return; } } for (auto t : p[0]) { if (m[1].count(k - t)) { Yes(1); return; } } for (auto t : p[1]) { if (m[0].count(k - t)) { Yes(1); return; } } Yes(0); } int main() { solve(); }