#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 1000000007
#define pb push_back
#define rep(i,x) for(int i=0;i<x;i++)
ll dpa[100005],dpb[100005],a,b,x[1000005],ruia[100005],ruib[100005];
int n;
int la,ra,lb,rb;
int main(){
	scanf("%d%lld%lld",&n,&a,&b);
	for(int i=1;i<=n;i++){
		scanf("%lld",&x[i]);
	}
	dpa[0] = 1; dpb[0] = 1;
	ruia[0] = 1; ruib[0] = 1;
	for(int i=2;i<=n;i++){
		int id = upper_bound(x+1,x+n+1,x[i]-a)-x;
		//[lb,min(rb,id-1)]
		int R = min(rb,id-1);
		if(lb<=R) dpa[i-1] = (ruib[R]-ruib[lb-1]+mod)%mod;
		ruia[i-1] = (ruia[i-2]+dpa[i-1])%mod;
		id = upper_bound(x+1,x+n+1,x[i]-b)-x;
		//[la,min(ra,id-1)]
		R = min(ra,id-1);
		if(la<=R) dpb[i-1] = (ruia[R]-ruia[la-1]+mod)%mod;
		ruib[i-1] = (ruib[i-2]+dpb[i-1])%mod;
		ra++; rb++;
		if(x[i]-x[i-1]<a){
			la = ra;
		}
		if(x[i]-x[i-1]<b){
			lb = rb;
		}
	}
	ll ans = 0;
	for(int i=la;i<=ra;i++) ans+=dpa[i];
	for(int i=lb;i<=rb;i++) ans+=dpb[i];
	cout<<ans%mod<<endl;
}