#include<bits/stdc++.h>

typedef unsigned int uint;
typedef long long ll;
typedef unsigned long long ull;
typedef double lf;
typedef long double llf;
typedef std::pair<int,int> pii;

#define xx first
#define yy second

template<typename T> inline T max(T a,T b){return a>b?a:b;}
template<typename T> inline T min(T a,T b){return a<b?a:b;}
template<typename T> inline T abs(T a){return a>0?a:-a;}
template<typename T> inline bool repr(T &a,T b){return a<b?a=b,1:0;}
template<typename T> inline bool repl(T &a,T b){return a>b?a=b,1:0;}
template<typename T> inline T gcd(T a,T b){T t;if(a<b){while(a){t=a;a=b%a;b=t;}return b;}else{while(b){t=b;b=a%b;a=t;}return a;}}
template<typename T> inline T sqr(T x){return x*x;}
#define mp(a,b) std::make_pair(a,b)
#define pb push_back
#define I inline
#define mset(a,b) memset(a,b,sizeof(a))
#define mcpy(a,b) memcpy(a,b,sizeof(a))

#define fo0(i,n) for(int i=0,i##end=n;i<i##end;i++)
#define fo1(i,n) for(int i=1,i##end=n;i<=i##end;i++)
#define fo(i,a,b) for(int i=a,i##end=b;i<=i##end;i++)
#define fd0(i,n) for(int i=(n)-1;~i;i--)
#define fd1(i,n) for(int i=n;i;i--)
#define fd(i,a,b) for(int i=a,i##end=b;i>=i##end;i--)
#define foe(i,x)for(__typeof((x).end())i=(x).begin();i!=(x).end();++i)

struct Cg{I char operator()(){return getchar();}};
struct Cp{I void operator()(char x){putchar(x);}};
#define OP operator
#define RT return *this;
#define RX x=0;char t=P();while((t<'0'||t>'9')&&t!='-')t=P();bool f=0;\
if(t=='-')t=P(),f=1;x=t-'0';for(t=P();t>='0'&&t<='9';t=P())x=x*10+t-'0'
#define RL if(t=='.'){lf u=0.1;for(t=P();t>='0'&&t<='9';t=P(),u*=0.1)x+=u*(t-'0');}if(f)x=-x
#define RU x=0;char t=P();while(t<'0'||t>'9')t=P();x=t-'0';for(t=P();t>='0'&&t<='9';t=P())x=x*10+t-'0'
#define TR *this,x;return x;
I bool IS(char x){return x==10||x==13||x==' ';}template<typename T>struct Fr{T P;I Fr&OP,(int&x)
{RX;if(f)x=-x;RT}I OP int(){int x;TR}I Fr&OP,(ll &x){RX;if(f)x=-x;RT}I OP ll(){ll x;TR}I Fr&OP,(char&x)
{for(x=P();IS(x);x=P());RT}I OP char(){char x;TR}I Fr&OP,(char*x){char t=P();for(;IS(t);t=P());if(~t){for(;!IS
(t)&&~t;t=P())*x++=t;}*x++=0;RT}I Fr&OP,(lf&x){RX;RL;RT}I OP lf(){lf x;TR}I Fr&OP,(llf&x){RX;RL;RT}I OP llf()
{llf x;TR}I Fr&OP,(uint&x){RU;RT}I OP uint(){uint x;TR}I Fr&OP,(ull&x){RU;RT}I OP ull(){ull x;TR}};Fr<Cg>in;
#define WI(S) if(x){if(x<0)P('-'),x=-x;char s[S],c=0;while(x)s[c++]=x%10+'0',x/=10;while(c--)P(s[c]);}else P('0')
#define WL if(y){lf t=0.5;for(int i=y;i--;)t*=0.1;if(x>=0)x+=t;else x-=t,P('-');*this,(ll)(abs(x));P('.');if(x<0)\
x=-x;while(y--){x*=10;x-=floor(x*0.1)*10;P(((int)x)%10+'0');}}else if(x>=0)*this,(ll)(x+0.5);else *this,(ll)(x-0.5);
#define WU(S) if(x){char s[S],c=0;while(x)s[c++]=x%10+'0',x/=10;while(c--)P(s[c]);}else P('0')
template<typename T>struct Fw{T P;I Fw&OP,(int x){WI(10);RT}I Fw&OP()(int x){WI(10);RT}I Fw&OP,(uint x){WU(10);RT}
I Fw&OP()(uint x){WU(10);RT}I Fw&OP,(ll x){WI(19);RT}I Fw&OP()(ll x){WI(19);RT}I Fw&OP,(ull x){WU(20);RT}I Fw&OP()
(ull x){WU(20);RT}I Fw&OP,(char x){P(x);RT}I Fw&OP()(char x){P(x);RT}I Fw&OP,(const char*x){while(*x)P(*x++);RT}
I Fw&OP()(const char*x){while(*x)P(*x++);RT}I Fw&OP()(lf x,int y){WL;RT}I Fw&OP()(llf x,int y){WL;RT}};Fw<Cp>out;

const int N=100007,P=1000000007;

struct node
{
	int sum,tag;
}fa[1<<18],fb[1<<18];

inline void build(node*f,int x,int l,int r)
{
	f[x].sum=0,f[x].tag=1;
	if(l^r)
	{
		int t=(l+r)>>1;
		build(f,x<<1,l,t);
		build(f,x<<1|1,t+1,r);
	}
}

inline void modify(node*f,int x,int l,int r,int p,int v)
{
	if(l==r)
	{
		f[x].sum=v;
	}
	else
	{
		int t=(l+r)>>1;
		if(p<=t)modify(f,x<<1,l,t,p,v);
		else modify(f,x<<1|1,t+1,r,p,v);
		f[x].sum=(ll)(f[x<<1].sum+f[x<<1|1].sum)*f[x].tag%P;
	}
}

inline void modq(node*f,int x,int l,int r,int ql,int qr,int v)
{
	if(l>=ql&&r<=qr)
	{
		f[x].tag=(ll)f[x].tag*v;
		f[x].sum=(ll)f[x].sum*v;
	}
	else
	{
		int t=(l+r)>>1;
		if(ql<=t)modq(f,x<<1,l,t,ql,qr,v);
		if(qr>t)modq(f,x<<1|1,t+1,r,ql,qr,v);
		f[x].sum=(ll)(f[x<<1].sum+f[x<<1|1].sum)*f[x].tag%P;
	}
}

inline int query(node*f,int x,int l,int r,int p)
{
	if(r<=p)return f[x].sum;
	int t=(l+r)>>1;
	if(p<=t)return (ll)query(f,x<<1,l,t,p)*f[x].tag%P;
	return (ll)(f[x<<1].sum+query(f,x<<1|1,t+1,r,p))*f[x].tag%P;
}

int n;
ll A,B,s[N];

int main()
{
	in,n,A,B;
	fo1(i,n)in,s[i];
	build(fa,1,0,n);
	build(fb,1,0,n);
	modify(fa,1,0,n,0,1);
	modify(fb,1,0,n,0,1);
	fo1(i,n)
	{
		int pa,pb,va,vb,vat,vbt;
		pa=std::upper_bound(s+1,s+n+1,s[i]-A)-s-1;
		va=query(fa,1,0,n,pa);
		vat=i>1?query(fa,1,0,n,min(i-2,pa)):1;
		pb=std::upper_bound(s+1,s+n+1,s[i]-B)-s-1;
		vb=query(fb,1,0,n,pb);
		vbt=i>1?query(fb,1,0,n,min(i-2,pb)):1;
		//out,i,':',pa,' ',pb,' ',va,' ',vb,' ',vat,' ',vbt,'\n';
		if(i==n)out,(va+vb)%P,'\n';
		modify(fa,1,0,n,i,va);
		modify(fb,1,0,n,i,vb);
		if(i>1&&va==vat)modq(fb,1,0,n,0,i-2,0);
		if(i>1&&vb==vbt)modq(fa,1,0,n,0,i-2,0);
		modify(fb,1,0,n,i-1,vat);
		modify(fa,1,0,n,i-1,vbt);
		//fo(j,0,i)out,query(fa,1,0,n,j),' ';out,'\n';
		//fo(j,0,i)out,query(fb,1,0,n,j),' ';out,'\n';
	}
}

Measured memory_bytes: 5248