#include <bits/stdc++.h>

int ri() {
	int n;
	scanf("%d", &n);
	return n;
}

bool solve(int n, int x, const std::vector<int> &a) {
	if (n == 1) return x == a[0];
	int64_t prod = 1;
	for (int i = 0; i < n; i++) {
		prod *= a[i] + 1;
		if (prod > x + 1) return false;
	}
	
	std::vector<std::bitset<5001> > dp(1 << n);
	for (int i = 0; i < n; i++) dp[1 << i][a[i]] = true;
	for (int i = 0; i < 1 << n; i++) {
		for (int j = 0; j < n; j++) {
			if (i >> j & 1) continue;
			std::bitset<5001> update;
			for (int k = 0; k <= 5000; k++) if (dp[i][k] && (k + 1) * a[j] + k <= 5000) update[(k + 1) * a[j] + k] = true;
			for (int k = 0; k <= 5000 - a[j]; k++) if (update[k]) update[k + a[j]] = true;
			dp[i | 1 << j] |= update;
		}
	}
	return dp.back()[x];
}

int main() {
	int n = ri(), x = ri();
	std::vector<int> a(n);
	for (int i = 0; i < n; i++) a[i] = ri();
	std::cout << (solve(n, x, a) ? "YES" : "NO") << std::endl;
	return 0;
}