#include #include #include using namespace atcoder; using namespace std; #define REP(i, m, n) for (int64_t i = (int64_t)(m); i < (int64_t)(n); i++) #define rep(i, n) REP(i, 0, n) #define RREP(i, m, n) for (int64_t i = (int64_t)(m - 1); i >= (int64_t)(n); i--) #define rrep(i, n) RREP(i, n, 0) #define all(v) v.begin(), v.end() using vi = vector; using vvi = vector; using vb = vector; using vvb = vector; using vc = vector; using vvc = vector; using vs = vector; using vvs = vector; using vd = vector; using vvd = vector; using pii = pair; using tii = tuple; using vp = vector; using vvp = vector; using vt = vector; using vvt = vector; using mint = modint; using vm = vector; using vvm = vector; using mii = map; using pdi = pair; using tdi = tuple; const int64_t INF = 2e18; const vp dxy = {{0, -1}, {-1, 0}, {0, 1}, {1, 0}}; template bool chmax(T &a, const T &b) { if (a < b) { a = b; return true; } return false; } template bool chmin(T &a, const T &b) { if (a > b) { a = b; return true; } return false; } int64_t to_int(char c) { return c - 'A'; } int64_t n, x, y; vi r; int64_t dist_sum; int64_t target_dist; int64_t dist_sum_without(int64_t i) { return dist_sum - 2 * r[i]; } bool check_inner(int64_t i) { int64_t d = dist_sum_without(i); if (target_dist >= r[i]) return (r[i] + d) >= (target_dist + (r[i] + d) - 1) / (r[i] + d); else return (r[i] - d <= 0 || target_dist >= (r[i] - d) * (r[i] - d)); } bool check() { rep(i, n) { if (check_inner(i)) return true; } return false; } int main() { cin >> n >> x >> y; r.resize(n); rep(i, n) cin >> r[i]; dist_sum = 0; for (auto x : r) dist_sum += 2 * x; target_dist = x * x + y * y; if (n == 1) { if (r[0] * r[0] == target_dist) cout << "Yes" << endl; else cout << "No" << endl; return 0; } if (check()) cout << "Yes" << endl; else cout << "No" << endl; }