#include <iostream>
#include <string>
#include <cmath>
#include<algorithm>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<iomanip>
#define _USE_MATH_DEFINES
#include <math.h>
#include <functional>
using namespace std;

#define rep(i,x) for(ll i=0;i<x;i++)
#define repn(i,x) for(ll i=1;i<=x;i++)

typedef long long ll;
const ll INF = 1e17;
const ll MOD = 1000000007;
const ll MAX = 1000001;

ll max(ll a, ll b) {
	if (a > b) { return a; }
	return b;
}

ll min(ll a, ll b) {
	if (a > b) { return b; }
	return a;
}

ll gcd(ll a, ll b) {
	if (b == 0) { return a; }
	if (a < b) { return gcd(b, a); }
	return gcd(b, a % b);
}

ll lcm(ll a, ll b) {
	return a / gcd(a, b) * b;
}

struct edge {
	ll ind;
	ll fr;
	ll to;
	ll d;
};

class mint {
    long long x;
public:
    mint(long long x = 0) : x((x% MOD + MOD) % MOD) {}
    mint operator-() const {
        return mint(-x);
    }
    mint& operator+=(const mint& a) {
        if ((x += a.x) >= MOD) x -= MOD;
        return *this;
    }
    mint& operator-=(const mint& a) {
        if ((x += MOD - a.x) >= MOD) x -= MOD;
        return *this;
    }
    mint& operator*=(const  mint& a) {
        (x *= a.x) %= MOD;
        return *this;
    }
    mint operator+(const mint& a) const {
        mint res(*this);
        return res += a;
    }
    mint operator-(const mint& a) const {
        mint res(*this);
        return res -= a;
    }
    mint operator*(const mint& a) const {
        mint res(*this);
        return res *= a;
    }
    mint pow(ll t) const {
        if (!t) return 1;
        mint a = pow(t >> 1);
        a *= a;
        if (t & 1) a *= *this;
        return a;
    }
    // for prime MOD
    mint inv() const {
        return pow(MOD - 2);
    }
    mint& operator/=(const mint& a) {
        return (*this) *= a.inv();
    }
    mint operator/(const mint& a) const {
        mint res(*this);
        return res /= a;
    }

    friend ostream& operator<<(ostream& os, const mint& m) {
        os << m.x;
        return os;
    }
};

///////////////////////////


int main() {
    ll N, A, B;
    cin >> N >> A >> B;

    vector<ll> S(N + 1);
    repn(i, N) cin >> S[i];

    vector<mint> dpx(N + 1,0), dpy(N + 1,0);
    dpx[1] = dpy[1] = 1;
    vector<mint> rdpx(N + 1), rdpy(N + 1);
    rdpx[1] = dpx[1];
    rdpy[1] = dpy[1];

    vector<ll> ruia(N+1, 0), ruib(N+1, 0);
    for(ll i=2; i<=N; i++) {
        ruia[i] = ruia[i - 1];
        ruib[i] = ruib[i - 1];

        if (S[i]-S[i-1]< A) { ruia[i]++; }
        if (S[i] - S[i - 1] < B) { ruib[i]++; }

        //cout << i << ruia[i] << ruib[i] << endl;
    }

    for (ll i = 2; i <= N; i++) {
        auto itr = upper_bound(++S.begin(), S.end(), S[i] - A);
        ll high = distance(S.begin(), itr);
        high = min(high, i - 1);

        itr = lower_bound(++ruib.begin(), ruib.end(), ruib[i - 1]);
        ll low = distance(ruib.begin(), itr);

        if (high >= low) { dpx[i] = rdpy[high] - rdpy[low - 1]; }
        rdpx[i] = rdpx[i - 1] + dpx[i];

        //cout << i << high << low << dpx[i] << endl;


        itr = upper_bound(++S.begin(), S.end(), S[i] - B);
        high = distance(S.begin(), itr);
        high = min(high, i - 1);

        itr = lower_bound(++ruia.begin(), ruia.end(), ruia[i - 1]);
        low = distance(ruia.begin(), itr);

        if (high >= low) { dpy[i] = rdpx[high] - rdpx[low - 1]; }
        rdpy[i] = rdpy[i - 1] + dpy[i];

        //cout << i << high << low << dpy[i] << endl;

    }

    mint ans = 0;
    auto itr = lower_bound(++ruib.begin(), ruib.end(), ruib[N]);
    ll low = distance(ruib.begin(), itr);
    ans += rdpy[N] - rdpy[low - 1];

    itr = lower_bound(++ruia.begin(), ruia.end(), ruia[N]);
    low = distance(ruia.begin(), itr);
    ans += rdpx[N] - rdpx[low - 1];
    
    cout << ans;

	system("PAUSE");
}

Measured memory_bytes: 6008