#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
#define MOD 1000000007
using namespace std;
const int MAXN = 100005;
long long s[MAXN],a,b;
int n,limita[MAXN],d[MAXN],suf[MAXN],sum[MAXN],f[MAXN];
int main()
{
	scanf("%d%lld%lld",&n,&a,&b);
	if(a<b)swap(a,b);
	for(int i=1;i<=n;++i)
		scanf("%lld",s+i);
	int p1=0,p2=0;
	s[0]=-max(a,b);
	for(int i=1;i<=n;++i)
		if(i>2)if(s[i]-s[i-2]<b){puts("0");return 0;}
	f[0]=sum[0]=1;
	s[n+1]=(long long)2e18+100;
	for(int i=1;i<=n+1;++i){
		while(s[i]-s[p1+1]>=a && p1+1<i)++p1;
		long long o=i>=2?s[i-1]-s[i-2]:max(a,b);
		if(o<b)p2=i-1;
		if(p1>=p2-1)f[i]=(sum[p1]-(p2>=2?sum[p2-2]:0)+MOD)%MOD;
		else f[i]=0;
		sum[i]=(sum[i-1]+f[i])%MOD;
	}
	cout<<f[n+1]<<endl;
	return 0;
}
