#pragma GCC optimize("Ofast")
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <queue>
#include <cstdio>
#include <ctime>
#include <assert.h>
#include <chrono>
#include <random>
#include <numeric>
#include <set>
#include <deque>
#include <stack>
#include <sstream>
#include <utility>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
#include <tuple>
#include <array>
#include <bitset>
using namespace std;
typedef long long int ll;
typedef unsigned long long ull;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll myRand(ll B) {
    return (ull)rng() % B;
}
inline double time() {
    return static_cast<long double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;
}

struct UnionFind{
    vector<int> par,num;
    UnionFind(int n):par(n),num(n,1){
        iota(par.begin(),par.end(),0);  //include<numeric>
    }
    int find(int v){
        return (par[v]==v)?v:(par[v]=find(par[v]));
    }
    void unite(int u,int v){
        u=find(u),v=find(v);
        if(u==v)return;
        if(num[u]<num[v])swap(u,v);
        num[u]+=num[v];
        par[v]=u;
    }
    bool same(int u,int v){
        return find(u) == find(v);
    }
    int size(int v){
        return num[find(v)];
    }
};

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n; cin >> n;
    ll X,Y; cin >> X >> Y;
    vector<ll> r(n);
    ll sum = 0;
    for(int i=0;i<n;i++){
        cin >> r[i];
    }
    sort(r.begin(), r.end());
    for(int i=1;i<n;i++){
        sum += 2*r[i];
    }
    // max(0,r[0]-sum) <= R <= r[0]+sum
    ll R = X*X+Y*Y;
    if(r[0]-sum > 0 and (r[0]-sum)*(r[0]-sum) > R){
        cout << "No" << endl;
    }
    else if(r[0]+sum < 3e9 and R > (r[0]+sum)*(r[0]+sum)){
        cout << "No" << endl;
    }
    else{
        cout << "Yes" << endl;
    }
}