#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using VI = vector<int>;
using VVI = vector<vector<int>>;
using VVVI = vector<vector<vector<int>>>;
using VL = vector<ll>;
using VVL = vector<vector<ll>>;
using VVVL = vector<vector<vector<ll>>>;
using VD = vector<double>;
using VVD = vector<vector<double>>;
using VVVD = vector<vector<vector<double>>>;
using VB = vector<bool>;
using VVB = vector<vector<bool>>;
using P = pair<int, int>;
using VP = vector<P>;

#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (ll i = a; i < (ll)(b); i++)
#define ALL(a) (a).begin(),(a).end()

constexpr int INF = 1001001001;
constexpr ll LINF = 1001001001001001001ll;
constexpr int DX[] = {1, 0, -1, 0};
constexpr int DY[] = {0, 1, 0, -1};

template< typename T1, typename T2>
inline bool chmax(T1 &a, T2 b) {return a < b && (a = b, true); }
template< typename T1, typename T2>
inline bool chmin(T1 &a, T2 b) {return a > b && (a = b, true); }

const ll MOD = 998244353;

ll mod_pow(ll x, ll n, ll mod) {
    ll res = 1;
    while (n > 0) {
        if (n & 1) res = res * x % mod;
        x = x * x % mod;
        n >>= 1;
    }
    return res;
}

ll gcd(ll x, ll y) {
    if (y == 0) return x;
    return gcd(y, x % y);
}

int main() {
    ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    int N, X, Y;
    cin >> N >> X >> Y;
    VI R(N);
    ll S = 0;
    REP(i, N) cin >> R[i];
    sort(ALL(R));
    REP(i, N) S += 2 * R[i];
    S -= R[0];
    if (N == 1) {
        if (1LL * X * X + 1LL * Y * Y == 1LL * R[0] * R[0]) cout << "Yes\n";
        else cout << "No\n";
    } else {
        if (S * S >= 1LL * X * X + 1LL * Y * Y) cout << "Yes\n";
        else cout << "No\n";
    }
}