#include <bits/stdc++.h>
using namespace std;
#define rep(i, n)  for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define all(a) a.begin(),a.end()
#define pb push_back
#define eb emplace_back
#define lb(v,k) (lower_bound(all(v),k)-v.begin())
#define ub(v,k) (upper_bound(all(v),k)-v.begin())
#define fi first
#define se second
#define pi M_PI
#define PQ(T) priority_queue<T>
#define SPQ(T) priority_queue<T,vector<T>,greater<T>>
#define dame(a) {out(a);return 0;}
#define decimal cout<<fixed<<setprecision(15);
typedef long long ll;
typedef pair<ll,ll> P;
typedef tuple<ll,ll,ll> PP;
typedef tuple<ll,ll,ll,ll> PPP;
typedef multiset<ll> S;
using vi=vector<ll>;
using vvi=vector<vi>;
using vvvi=vector<vvi>;
using vp=vector<P>;
using vvp=vector<vp>;
using vb=vector<bool>;
using vvb=vector<vb>;
const ll inf=1001001001001001001;
const int INF=1001001001;
const int mod=1000000007;
const double eps=1e-10;
template<class T> bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}
template<class T> bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}
template<class T> void out(T a){cout<<a<<'\n';}
template<class T> void outp(T a){cout<<'('<<a.fi<<','<<a.se<<')'<<'\n';}
template<class T> void outvp(T v){rep(i,v.size())cout<<'('<<v[i].fi<<','<<v[i].se<<')';cout<<'\n';}
template<class T> void outvvp(T v){rep(i,v.size())outvp(v[i]);}
template<class T> void outv(T v){rep(i,v.size()){if(i)cout<<' ';cout<<v[i];}cout<<'\n';}
template<class T> void outvv(T v){rep(i,v.size())outv(v[i]);}
template<class T> bool isin(T x,T l,T r){return (l)<=(x)&&(x)<=(r);}
template<class T> void yesno(T b){if(b)out("yes");else out("no");}
template<class T> void YesNo(T b){if(b)out("Yes");else out("No");}
template<class T> void YESNO(T b){if(b)out("YES");else out("NO");}
template<class T> void noyes(T b){if(b)out("no");else out("yes");}
template<class T> void NoYes(T b){if(b)out("No");else out("Yes");}
template<class T> void NOYES(T b){if(b)out("NO");else out("YES");}
void outs(ll a,ll b){if(a>=inf-100)out(b);else out(a);}
ll gcd(ll a,ll b){if(b==0)return a;return gcd(b,a%b);}
ll modpow(ll a,ll b){a%=mod;if(b==0)return 1;if(b&1)return a*modpow(a,b-1)%mod;ll k=modpow(a,b/2);return k*k%mod;}
vi seg;
ll N;
void init(vi v){
    N=1;
    while(N<v.size())N*=2;
    seg=vi(N*2-1,inf);
    rep(i,v.size())seg[i+N-1]=v[i];
    for(int i=N-2;i>=0;i--)seg[i]=min(seg[i*2+1],seg[i*2+2]);
}
void update(ll i,ll x){
    i=N+i-1;
    seg[i]=x;
    while(i>0){
        i=(i-1)/2;
        seg[i]=min(seg[i*2+1],seg[i*2+2]);
    }
}
ll getmi(ll a,ll b,ll k,ll l,ll r){
    if(r<=a||b<=l)return inf;
    if(a<=l&&r<=b)return seg[k];
    ll c1=getmi(a,b,k*2+1,l,(l+r)/2);
    ll c2=getmi(a,b,k*2+2,(l+r)/2,r);
    return min(c1,c2);
}
ll n,a,b;
vi v;
vi dp,dp1,dp2;
ll dfs2(ll i);
ll dfs1(ll i){
    if(dp1[i]!=-2)return dp1[i];
    ll it=lb(v,v[i]+a)-1;
    if(it==i){
        dp1[i]=i+1;
        return i+1;
    }
    if(getmi(i+1,it,0,0,N)<b){
        dp1[i]=-1;
        return -1;
    }
    dp1[i]=dfs2(it);
    return dp1[i];
}
ll dfs2(ll i){
    if(dp2[i]!=-2)return dp2[i];
    ll it=lb(v,v[i]+b)-1;
    if(it==i){
        dp2[i]=i+1;
        return i+1;
    }
    if(getmi(i+1,it,0,0,N)<a){
        dp2[i]=-1;
        return -1;
    }
    dp2[i]=dfs1(it);
    return dp2[i];
}
ll dfs(ll i){
    if(i==-1)return 0;
    if(i==n)return 1;
    if(dp[i]!=-1)return dp[i];
    dp[i]=(dfs(dfs1(i))+dfs(dfs2(i)))%mod;
    return dp[i];
}
int main(){
    cin>>n>>a>>b;
    v=vi(n);
    rep(i,n)cin>>v[i];
    dp=vi(n,-1);dp1=vi(n,-2);dp2=vi(n,-2);
    vi t(n-1);
    rep(i,n-1)t[i]=v[i+1]-v[i];
    init(t);
    out(dfs(0));
}

Measured memory_bytes: 9328