#include "bits/stdc++.h"
using namespace std;
#define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i))
#define rep(i,j) FOR(i,0,j)
#define each(x,y) for(auto &(x):(y))
#define mp make_pair
#define mt make_tuple
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<(x)<<endl
#define smax(x,y) (x)=max((x),(y))
#define smin(x,y) (x)=min((x),(y))
#define MEM(x,y) memset((x),(y),sizeof (x))
#define sz(x) (int)(x).size()
#define pb push_back
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;

template<int MOD>
class ModInt{
public:
    ModInt():value(0){}
    ModInt(long long val):value((int)(val<0?MOD+val%MOD:val%MOD)){ }

    ModInt& operator+=(ModInt that){
        value = value+that.value;
        if(value>=MOD)value-=MOD;
        return *this;
    }
    ModInt& operator-=(ModInt that){
        value -= that.value;
        if(value<0)value+=MOD;
        return *this;
    }
    ModInt& operator*=(ModInt that){
        value = (int)((long long)value * that.value % MOD);
        return *this;
    }
    ModInt &operator/=(ModInt that){
        return *this *= that.inverse();
    }
    ModInt operator+(ModInt that) const{
        return ModInt(*this)+=that;
    }
    ModInt operator-(ModInt that) const{
        return ModInt(*this)-=that;
    }
    ModInt operator*(ModInt that) const{
        return ModInt(*this)*=that;
    }
    ModInt operator/(ModInt that) const {
        return ModInt(*this) /= that;
    }
    ModInt pow(long long k) const{
        if(value == 0)return 0;
        ModInt n = *this, res = 1;
        while(k){
            if(k & 1)res *= n;
            n *= n;
            k >>= 1;
        }
        return res;
    }
    ModInt inverse() const {
        long long a = value, b = MOD, u = 1, v = 0;
        while(b) {
            long long t = a / b;
            a -= t * b;
            swap(a, b);
            u -= t * v;
            swap(u, v);
        }
        return ModInt(u);
    }
    int toi() const{ return value; }

private:
    int value;
};
typedef ModInt<1000000007> mint;
ostream& operator<<(ostream& os, const mint& x){
    os << x.toi();
    return os;
}

template<class Val>
struct BinaryIndexedTree{
    int n;
    vector<Val> t;
    BinaryIndexedTree(){}
    BinaryIndexedTree(int _n):n(_n+1), t(_n+1){}
    void add(int k, Val val){
        k++;
        while(k < n){
            t[k] += val;
            k += (k&-k);
        }
    }
    void set(int k, Val val) {
        add(k, -sum(k, k + 1));
        add(k, val);
    }
    Val sum(int k){
        Val r = 0;
        while(k > 0){
            r += t[k];
            k -= (k&-k);
        }
        return r;
    }
    Val sum(int l, int r){
        return sum(r) - sum(l);
    }
};
typedef BinaryIndexedTree<mint> BIT;

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);

    int n;
    ll a, b;
    cin >> n >> a >> b;
    if(a > b)swap(a, b);
    vll s(n+1);
    rep(i, n) {
        cin >> s[i+1];
    }
    
    s[0] = -(1ll << 60);
    BIT g(n + 1);
    g.add(0, 1);

    rep(i, n - 1) {
        if(s[i] + a > s[i+2]) {
            cout << 0 << endl;
            return 0;
        }
    }
    mint sm = 0;
    int l = 0, r = 1;
    for(int i = 1; i <= n; ++i) {
        for(; r < i && s[i] - s[r] >= b; r++);
        g.add(i, g.sum(l, r));
        if(s[i] - s[i - 1] < a) {
            for(; l < i - 1; ++l) g.add(l, g.sum(l, l + 1)*(-1));
        }
    }
    cout << g.sum(n + 1) << endl;
}


Measured memory_bytes: 1408