#include <bits/stdc++.h>
#include <atcoder/all>

typedef unsigned long long ULLONG;
typedef long long LLONG;
static const LLONG MOD_NUM = 998244353LL;//1000000007LL;
static const LLONG INF_NUM = 1e18;
static const int CH_KINDS = 'z' - 'a' + 1;
template<class _T> static void get(_T& a) {
	std::cin >> a;
}
template<class _T> static void get(_T& a, _T& b) {
	std::cin >> a >> b;
}
template<class _T> static void get(_T& a, _T& b, _T& c) {
	std::cin >> a >> b >> c;
}
template <class _T> static _T tp_abs(_T a) {
	if (a < (_T)0) {
		a *= (_T)-1;
	}
	return a;
}
template <class _T> static _T tp_pow(int x, int exp)
{
	_T ans = 1;
	_T base = x;
	while (exp > 0) {
		if (exp & 1) {
			ans = (ans * base);
		}
		base = (base * base);
		exp >>= 1;
	}
	return ans;
}

static void task();

int main()
{
	task();
	fflush(stdout);
	return 0;
}

static void task()
{
	int N;
	get(N);

	LLONG X, Y;
	get(X, Y);

	std::vector<LLONG> ri(N);
	LLONG min = 1e10;
	LLONG sum = 0;
	for (int i = 0; i < N; i++) {
		get(ri[i]);
		min = std::min(min, ri[i]);
		sum += ri[i] * 2;
	}
	if (N == 1) {
		if (min * min == (X * X + Y * Y)) {
			printf("Yes\n");
		}
		else {
			printf("No\n");
		}
	}
	else if ((sum - min) * (sum - min) >= (X * X + Y * Y)) {
		printf("Yes\n");
	}
	else {
		printf("No\n");
	}
}