#include <bits/stdc++.h>
using namespace std;
int a[100010], s[100010], n, l, r, m;
double minn, maxn;
bool check(int x) {
  int left = s[x], right = s[n] - s[x];
  double dt1, dt2;
  dt1 = maxn * left - minn * right;
  dt2 = minn * left - maxn * right;
  if (dt1 * dt2 < 0) return true;
  dt1 = fabs(dt1);
  dt2 = fabs(dt2);
  if (min(dt1, dt2) < m + 1e-6) return true;
  return false;
}
int main() {
  scanf("%d%d%d%d", &n, &l, &m, &r);
  minn = r * 1.0;
  maxn = l * 0.5;
  if (maxn < minn + 1e-6) {
    printf("No\n");
    return 0;
  }
  s[0] = 0;
  for (int i = 1; i <= n; i++) {
    scanf("%d", &a[i]);
    s[i] = a[i] + s[i - 1];
  }
  for (int i = 0; i <= n; i++) {
    if (check(i)) {
      printf("Yes\n");
      return 0;
    }
  }
  printf("No\n");
  return 0;
}
