#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)

using namespace std;
using LL = long long;
using P = pair<int,int>;
using vv = vector<vector<int>>;
const int INF = (int)2e9;
const LL LINF = (LL)1e18;

int main(){
	int N;
	LL X, Y;
	cin >> N >> X >> Y;
	vector<LL> R(N);
	rep(i,N) cin >> R[i];
	if(N == 1){
		if(X * X + Y * Y == R[0] * R[0]) cout << "Yes" << endl;
		else cout << "No" << endl;
		return 0;
	}
	sort(R.begin(), R.end());
	LL tot = R[0];
	rep(i,N-1) tot += R[i] * 2;
	if(tot > INF) cout << "Yes" << endl;
	else if(tot * tot >= X * X + Y * Y) cout << "Yes" << endl;
	else cout << "No" << endl;

	return 0;
}