#include #include using namespace atcoder; using mint = modint998244353; using namespace std; #define rep(i,n) for (int i = 0; i < (n); ++i) #define Inf 1000000000 int main() { long long n,x,y; cin>>n>>x>>y; vector r(n); rep(i,n)cin>>r[i]; sort(r.begin(),r.end()); long long m=0,M=0; rep(i,n){ if(i==0)M += r[i]; else M += r[i]*2; if(i==0)m += r[i]; else m -= r[i]*2; } m = max(m,0LL); M = min(M,2300000000LL); long long D = x*x + y*y; m *= m; M *= M; if(D>=m && D<=M)cout<<"Yes"<