#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;

int main(){
    cin.tie(0);
    ios::sync_with_stdio(0);
    
    ll N,X,Y; cin >> N >> X >> Y;
    vector<ll> R(N);
    rep(i,N) cin >> R[i];
    ll XY = X * X + Y * Y;

    if(N == 1 && XY != R[0] * R[0]) {
        cout << (XY != R[0] * R[0] ? "No"  : "Yes") << endl;
    } else {
        ll sum = accumulate(R.begin(), R.end(), 0LL);
        ll ma = *max_element(R.begin(), R.end());
        ll mi = *min_element(R.begin(), R.end());
        ll R = sum * 2 - mi;
        ll L = max(0LL, mi - (sum - mi) * 2);
        cout << ((__int128_t)L * L <= XY && XY <= (__int128_t)R * R? "Yes" : "No") << endl;
    }
}