#include <bits/stdc++.h>
using namespace std;
int n;
long long int m, l, r;
long long int sum[1000001];
int main(int argc, char *argv[]) {
  cin >> n >> l >> m >> r;
  for (int i = 1; i <= n; i++) {
    long long int a;
    scanf("%lld", &a);
    sum[i] = sum[i - 1] + a;
  }
  bool con = 0;
  if (2 * r > l) {
    cout << "No" << endl;
  } else {
    for (int i = 1; i <= n; i++) {
      long long int a = sum[i];
      long long int b = sum[n] - sum[i];
      if (a > b) swap(a, b);
      if (a * l < b * 2 * r) {
        if (2 * b * r - a * l <= 2 * m) {
          con = 1;
          break;
        }
      } else {
        con = 1;
        break;
      }
    }
    if (con)
      cout << "Yes" << endl;
    else
      cout << "No" << endl;
  }
  return 0;
}
