#include <bits/stdc++.h>
using namespace std;
int main(){
  int N, X, Y;
  cin >> N >> X >> Y;
  vector<int> R(N);
  for (int i = 0; i < N; i++){
    cin >> R[i];
  }
  vector<long long> mx(N), mn(N);
  mx[0] = R[0];
  mn[0] = R[0];
  for (int i = 1; i < N; i++){
    mx[i] = mx[i - 1] + R[i] * 2;
    mn[i] = max(mn[i - 1] - R[i] * 2, (long long) 0);
  }
  mx[N - 1] = min(mx[N - 1], (long long) 1500000000);
  if (mx[N - 1] * mx[N - 1] < (long long) X * X + (long long) Y * Y){
    cout << "No" << endl;
  } else if (mn[N - 1] * mn[N - 1] > (long long) X * X + (long long) Y * Y){
    cout << "No" << endl;
  } else {
    cout << "Yes" << endl;
  }
}