#include <bits/stdc++.h>
using namespace std;

typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
//typedef vector<vector<ll>> Graph;

const ll mod = 1e9 + 7;
//const ll mod = 998244353;

#define REP(i,n) for(ll i=0;i<(ll)n;i++)
#define dump(x)  cerr << #x << " = " << (x) << endl;
#define spa << " " <<
#define fi first
#define se second

template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }

template<class S, class T> ostream& operator << (ostream& os, const pair<S, T> v){
os << "(" << v.first << ", " << v.second << ")"; return os;
}
template<class T> ostream& operator << (ostream& os, const vector<T> v){
for(int i = 0; i < (int)v.size(); i++){if(i > 0){os << " ";} os << v[i];} return os;
}
template<class T> ostream& operator << (ostream& os, const vector<vector<T>> v){
for(int i = 0; i < (int)v.size(); i++){if(i > 0){os << endl;} os << v[i];} return os;
}

template<typename T> void debug(vector<vector<T>>&v,ll h,ll w){for(ll i=0;i<h;i++)
{cerr<<v[i][0];for(ll j=1;j<w;j++)cerr spa v[i][j];cerr<<endl;}};
template<typename T> void debug(vector<T>&v,ll n){if(n!=0)cerr<<v[0];
for(ll i=1;i<n;i++)cerr spa v[i];
cerr<<endl;};

template <std::uint_fast64_t Modulus> class modint {
  // long long から modint を作るときは必ず正の数にしてからコンストラクタに入れること！ 
  // そうしないとバグります
  using u64 = std::uint_fast64_t;

public:
  u64 a;

  constexpr modint(const u64 x = 0) noexcept : a(x % Modulus) {}
  constexpr u64 &value() noexcept { return a; }
  constexpr const u64 &value() const noexcept { return a; }
  constexpr modint operator+(const modint rhs) const noexcept {
    return modint(*this) += rhs;
  }
  constexpr modint operator-(const modint rhs) const noexcept {
    return modint(*this) -= rhs;
  }
  constexpr modint operator*(const modint rhs) const noexcept {
    return modint(*this) *= rhs;
  }
  constexpr modint operator/(const modint rhs) const noexcept {
    return modint(*this) /= rhs;
  }
  constexpr modint &operator+=(const modint rhs) noexcept {
    a += rhs.a;
    if (a >= Modulus) {
      a -= Modulus;
    }
    return *this;
  }
  constexpr modint &operator-=(const modint rhs) noexcept {
    if (a < rhs.a) {
      a += Modulus;
    }
    a -= rhs.a;
    return *this;
  }
  constexpr modint &operator*=(const modint rhs) noexcept {
    a = a * rhs.a % Modulus;
    return *this;
  }
  constexpr modint &operator/=(modint rhs) noexcept {
    u64 exp = Modulus - 2;
    while (exp) {
      if (exp % 2) {
        *this *= rhs;
      }
      rhs *= rhs;
      exp /= 2;
    }
    return *this;
  }
};
using mint = modint<mod>;

template <class T, class U> constexpr T power(T x, U exp) {
  T ret = static_cast<T>(1);
  while (exp) {
    if (exp % static_cast<U>(2) == static_cast<U>(1))
      ret *= x;
    exp /= static_cast<U>(2);
    x *= x;
  }
  return ::std::move(ret);
}

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

    ll N, A, B;
    cin >> N >> A >> B;
    vector<ll> S(N+1);
    REP(i, N) cin >> S[i+1];
    const ll INF= (1ll<<60);
    S[0] = -INF;

    // vector<vector<mint>> dp1(N+1, vector<mint>(N+1, 0)), dp2(N+1, vector<mint>(N+1, 0));
    // dp1[0][0] = 1;

    // REP(i, N){
    //     REP(j, N+1){
    //         if(S[i+1]>=S[i]+A) dp1[i+1][j] += dp1[i][j];
    //         if(S[i+1]>=S[j]+A) dp1[i+1][i] += dp2[i][j];

    //         if(S[i+1]>=S[j]+B) dp2[i+1][i] += dp1[i][j];
    //         if(S[i+1]>=S[i]+B) dp2[i+1][j] += dp2[i][j];
    //     }
    // }

    // mint res = 0;
    // REP(i, N+1) res += dp1[N][i];
    // REP(i, N+1) res += dp2[N][i];
    // cerr << res.value() << endl;

    // REP(i, N+1){
    //     dump(i)
    //     REP(j, N+1){
    //         cerr << dp1[i][j].value() << " ";
    //     }
    //     cerr << endl;
    //     REP(j, N+1){
    //         cerr << dp2[i][j].value() << " ";
    //     }
    //     cerr << endl;
    // }

    vector<mint> dq1(N+1, 0), dq2(N+1, 0);
    dq1[0] = 1;
    dq2[0] = 1;
    mint cnt1 = 0, cnt2 = 0;
    ll right1=0, right2=0;
    ll left1=0, left2=0;
    for(int i=1;i<N;i++){
        while(right1<i and S[right1]<=S[i+1]-B){
            cnt1 += dq1[right1];
            right1++;
        }
        while(right2<i and S[right2]<=S[i+1]-A){
            cnt2 += dq2[right2];
            right2++;
        }

        // dump(right1)
        // dump(right2)

        dq1[i] += cnt2;
        dq2[i] += cnt1;

        if(S[i]>S[i+1]-A){
            right1 = i;
            left1 = i;
            cnt1 = 0;
        }
        if(S[i]>S[i+1]-B){
            right2 = i;
            left2 = i;
            cnt2 = 0;
        }
        // dump(cnt1.value())
        // dump(cnt2.value())
    }

    mint ans = 0;
    for(int i=left1;i<N;i++) ans += dq1[i];
    for(int i=left2;i<N;i++) ans += dq2[i];
    cout << ans.value() << endl;

    // REP(i, N) cerr << dq1[i].value() << " ";
    // cerr << endl;
    // REP(i, N) cerr << dq2[i].value() << " ";
    // cerr << endl;

    return 0;
}

Measured memory_bytes: 5572