#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <array>
#include <atcoder/modint>
using namespace std;
using i32 = int32_t;
using u32 = uint32_t;
using i64 = int64_t;
using u64 = uint64_t;
#define rep(i,n) for(int i=0; i<(int)(n); i++)

const i64 INF = 1001001001001001001;

using modint = atcoder::static_modint<998244353>;

int main(){
    int N; cin >> N;
    i64 X,Y; cin >> X >> Y;
    vector<i64> R(N);
    rep(i,N) cin >> R[i];
    if(N == 1){
        if(X*X + Y*Y == R[0] * R[0]){
            cout << "Yes\n";
        }
        else cout << "No\n";
        return 0;
    }
    sort(R.begin(), R.end());
    i64 r = 0;
    for(auto rr : R) r += rr * 2;
    if(r >= 2'000'000'000){ cout << "Yes\n"; return 0; }

    i64 maxR = (r - R[0]) * (r - R[0]);
    i64 xy = X*X + Y*Y;
    if(maxR < xy) cout << "No\n"; else cout << "Yes\n";
    return 0;
}


struct ios_do_not_sync{
    ios_do_not_sync(){
        std::ios::sync_with_stdio(false);
        std::cin.tie(nullptr);
    }
} ios_do_not_sync_instance;