#include<bits/stdc++.h>

using namespace std;

using ll = long long;
using ld = long double;

#define rep(i, a, b) for(ll i = (ll)a; i < (ll)b; i++)
#define irep(i, v) for(auto i = (v).begin(); i != (v).end(); i++)
#define ALL(v) (v).begin(), (v).end()
#define SZ(v) (ll)(v).size()

const ll INF = 3e18;
const ld EPS = 1e-10;
const ll MOD = 1e9 + 7;
const ld PI = M_PI;

int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  srand((unsigned)time(NULL));
  cout << fixed << setprecision(20);

  ll n, x, y;
  cin >> n >> x >> y;

  ll dis = x * x + y * y;
  vector<ld> r(n);
  rep(i, 0, n) cin >> r[i];
  sort(ALL(r));
  ld sum = 0;

  if(n == 1){
    if(x * x + y * y == r[0] * r[0]) cout << "Yes" << endl;
    else cout << "No" << endl;
    return 0;
  }

  rep(i, 0, n){
    sum += 2 * r[i];
  }
  sum -= r[0];

  if(INF / sum < sum) cout << "Yes" << endl;
  else if(dis > sum * sum) cout << "No" << endl;
  else cout << "Yes" << endl;


  return 0;
}