#include<stdio.h>
#include<string.h>
#include<algorithm>
#define N 100010
#define mid (l+r>>1)
#define LL long long
#define M 1000000007
using namespace std;
int n,m,f[N]; LL A,B,s[N],w[N<<2];
void change(int p,int l,int r,int a,int b){
    if(l==r){ (w[p]+=b)%=M; return; }
    if(a<=mid)change(p*2,l,mid,a,b);
	else change(p*2+1,mid+1,r,a,b);
    w[p]=(w[p*2]+w[p*2+1])%M;
}
int query(int p,int l,int r,int a,int b){
    if (a>b) return 0;
    if (l==a&&r==b) return w[p];
    if (b<=mid) return query(p*2,l,mid,a,b);
    else if (a>mid) return query(p*2+1,mid+1,r,a,b);
    else return (query(p*2,l,mid,a,mid)+query(p*2+1,mid+1,r,mid+1,b))%M;
}
main(){
	scanf("%d%lld%lld",&n,&A,&B);
	if(A<B) swap(A,B); f[0]=1; 
	for(int i=1;i<=n;++i) scanf("%lld",s+i);
	*s=-A; s[n+1]=A+s[n]; int l=0,r=0; change(1,0,n,0,f[0]);
	for(int i=1;i<=n+1;++i){
		while(s[i]-s[r+1]>=A) ++r;
		if(i>=2 && s[i-1]-s[i-2]<B) l=i-2;
		if(s[i]-s[i-1]>=A) f[i]=f[i-1];
		f[i]=(f[i]+query(1,0,n,l,min(r,i-2)))%M;
		if(s[i+1]-s[i-1]>=B) change(1,0,n,i,f[i]);
	}
	printf("%lld\n",(f[n+1]+M)%M);
}