#include<iostream>
#include<cstdio>
using namespace std;
const int N=1e5+10,p=1e9+7;
int n,f[N],fp,fz,g[N],gp,gz;
long long A,B,s[N];
int main(){
	scanf("%d%lld%lld",&n,&A,&B);
	for (int i=1;i<=n;++i) scanf("%lld",s+i);
	s[0]=-2e18;
	f[0]=1;g[0]=1;
	for (int i=2;i<=n;++i){
		while (fp<i-2&&s[i]-s[fp+1]>=A) ++fp;
		f[i-1]=g[fp];
		while (gp<i-2&&s[i]-s[gp+1]>=B) ++gp;
		g[i-1]=f[gp];
		if (s[i]-s[i-1]<A){
			while (fz<i-1) f[fz++]=0;
		}else (f[i-1]+=f[i-2])%=p;
		if (s[i]-s[i-1]<B){
			while (gz<i-1) g[gz++]=0;
		}else (g[i-1]+=g[i-2])%=p;
	}
	printf("%d",(f[n-1]+g[n-1])%p);
	return 0;
}