#include<bits/stdc++.h>
#define L long long
using namespace std;
const int q=1000000007;
int n,u[100010],v[100010];
L a,b,x[100010];
struct dp
{
    int a[100010],b[100010],t;
    inline int& operator[](int i)
    {
        if(b[i]<t)
          b[i]=t,a[i]=0;
        return a[i];
    }
}f,g;
int main()
{
	//freopen(".in","r",stdin);
	//freopen(".out","w",stdout);
	int i,j,k;
	scanf("%d%lld%lld",&n,&a,&b);
	for(i=1,j=0,k=0;i<=n;i++)
	  {
	   scanf("%lld",&x[i]);
	   while(x[i]-x[j+1]>=a)
	     j++;
	   while(x[i]-x[k+1]>=b)
	     k++;
	   u[i]=j;
	   v[i]=k;
      }
    f[0]=g[0]=1;
    for(i=0;i<n;i++)
     f.b[i]=g.b[i]=i+1;
    for(i=2;i<=n;i++)
      {
       f[i-1]=g[min(u[i],i-2)];
       g[i-1]=f[min(v[i],i-2)];
       if(u[i]<i-1)
         f.t=i;
       if(v[i]<i-1)
         g.t=i;
       f[i-1]=(f[i-1]+f[i-2])%q;
       g[i-1]=(g[i-1]+g[i-2])%q;
      }
    printf("%d\n",(f[n-1]+g[n-1])%q);
	return 0;
}
