#include <bits/stdc++.h>
using namespace std;

using P = pair<int, int>;
#define test cout << "test:"
const int inf = 1073741824;
const long long linf = 1152921504606846976;
// const int mod = 998244353;
// const int mod = 1000000007;
const int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};

void _main()
{
	long long n, x, y;
	cin >> n >> x >> y;
	vector<long long> r(n);
	for (int i = 0; i < n; i++)
		cin >> r[i];
	sort(r.begin(), r.end());

	long long sum = 0;
	for (int i = 0; i < n; i++)
	{
		if (i == 0)
		{
			if (n == 1 and r[0] * r[0] != x * x + y * y)
			{
				cout << "No\n";
				return;
			}

			sum += r[0];
		}
		else
			sum += 2 * r[i];
	}

	cout << (sum * sum >= x * x + y * y ? "Yes\n" : "No\n");
	return;
}

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout << fixed << setprecision(15);
	_main();
}