#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <set>
#include <map>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

using namespace std;
typedef long long ll;

const ll MOD = 1000000007;

class ModInt{
    public:
    ll v;
    ModInt(ll _v = 0){
        v = _v;
    }
    ModInt operator+(ll n){
        return ModInt((v+n)%MOD);
    }
    ModInt operator-(ll n){
        return ModInt((v-n+MOD)%MOD);
    }
    ModInt operator*(ll n){
        return ModInt((v*n)%MOD);
    }
    ModInt operator/(ll n){
        return ModInt((ModInt(n).inv()*v).v%MOD);
    }

    void operator+=(ll n){
        v = (v+n)%MOD;
    }
    void operator-=(ll n){
        v = (v-n+MOD)%MOD;
    }
    void operator*=(ll n){
        v = (v*n)%MOD;
    }
    
    
    ModInt operator+(ModInt n){
        return ModInt((v+n.v)%MOD);
    }
    ModInt operator-(ModInt n){
        return ModInt((v-n.v+MOD)%MOD);
    }
    ModInt operator*(ModInt n){
        return ModInt((v*n.v)%MOD);
    }
    ModInt operator/(ModInt n){
        return ModInt((n.inv()*v).v%MOD);
    }

    void operator+=(ModInt n){
        v = (v+n.v)%MOD;
    }
    void operator-=(ModInt n){
        v = (v-n.v+MOD)%MOD;
    }
    void operator*=(ModInt n){
        v = (v*n.v)%MOD;
    }

    void operator=(ModInt n){
        v = n.v;
    }
    void operator=(ll n){
        v = n;
    }

    ModInt inv(){
        if(v == 1) return ModInt(1);
        else return ModInt(MOD-ModInt(MOD%v).inv().v*(MOD/v)%MOD);
    }
};

ostream& operator<<(ostream& os, const ModInt& m){
    os << m.v;
    return os;
}

istream & operator >> (istream &in,  ModInt &m){
    in >> m.v;
    return in;
}

int N;
ll A, B;
ll S[100000];
ModInt dp_x[100000];
ModInt dp_y[100000];

// [ok_x[i], ..., i]をすべてXにできるような最小値
int ok_x[100000], ok_y[100000];

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    cin >> N >> A >> B;
    if(A > B) swap(A, B);
    for(int i = 0; i < N; i++) cin >> S[i];
    ok_x[0] = 0; ok_y[0] = 0;
    for(int i = 1; i < N; i++){
        if(S[i]-S[i-1] >= A) {
            ok_x[i] = ok_x[i-1];
        }else{
            ok_x[i] = i;
        }
        
        if(S[i]-S[i-1] >= B) {
            ok_y[i] = ok_y[i-1];
        }else{
            ok_y[i] = i;
        }
    }
    
    dp_x[0] = 1, dp_y[0] = 1;
    for(int i = 1; i < N; i++){
        // i -> X
        {
            // i-1 -> X
            if(S[i]-S[i-1] >= A){
                dp_x[i] += dp_x[i-1];
            }
            // i-1 -> Y
            auto p = upper_bound(S, S+N, S[i]-A);
            int l = ok_y[i-1]-1;
            if(p == S){
                if(ok_y[i-1] == 0) dp_x[i] += 1;
            }else{
                int r = (p-S)-1;
                r = min(r, i-2);
                if(l <= r) dp_x[i] += dp_y[r+1];
                // dp_x[i] += sum_dp_x(l, r);
                // cout << i << ' ' << S[i] << ' ' << l << ' ' << r << ' ' << sum_dp_x(l, r) << endl;
            }
        }
        // i -> Y
        {
            // i-1 -> Y
            if(S[i]-S[i-1] >= B){
                dp_y[i] += dp_y[i-1];
            }
            // i-1 -> X
            auto p = upper_bound(S, S+N, S[i]-B);
            int l = ok_x[i-1]-1;
            if(p == S){
                if(ok_x[i-1] == 0) dp_y[i] += 1;
            }else{
                int r = (p-S)-1; 
                r = min(r, i-2);
                if(l <= r) dp_y[i] += dp_x[r+1];
                // dp_y[i] += sum_dp_y(l, r);
            }

        }
        // cout << dp_x[i] << ' ' << dp_y[i] << endl;
    }
    cout << dp_x[N-1]+dp_y[N-1] << endl;
}

Measured memory_bytes: 6740