a#include <vector>
#include <deque>
#include <queue>
#include <stack>
#include <algorithm>
#include <fstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
using namespace std;
#define inf 2147480000
int n;
double 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;
    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);
        long long int maxn1=a*l/2;long long int maxn2=b*l/2;
        long long int minn1=a*r;long long int minn2=b*r;
        if(maxn1<minn2)
        {
            if(minn2-maxn1<=m)
            {
               con=1;break;
            }
        }
        else
        {
          con=1;break;
        }
    }
    if(con) cout<<"Yes"<<endl;
    else cout<<"No"<<endl;
    return 0;
}