#include <bits/stdc++.h>

using namespace std;
 
#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl;
#define DEBUG_MAT(v) cerr<<#v<<endl;for(int i=0;i<v.size();i++){for(int j=0;j<v[i].size();j++) {cerr<<v[i][j]<<" ";}cerr<<endl;}
typedef long long ll;
// #define int ll
 
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define pll pair<ll,ll>
template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first + t.first, s.second + t.second); }
template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }
template<class S, class T> ostream& operator<<(ostream& os, pair<S, T> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
#define X first
#define Y second
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--)
#define rrep1(i,n) for(int i=(int)(n);i>0;i--)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(),c.end()
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; }
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
const long double pi = 3.1415926535897932384626433832795028841971L;
#define Sp(p) cout<<setprecision(25)<< fixed<<p<<endl;
// int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
// int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
vi dx = {1, 0, -1, 0}, dy = {0, 1, 0, -1};
// vi dx2 = { 1,1,0,-1,-1,-1,0,1 }, dy2 = { 0,1,1,1,0,-1,-1,-1 };
#define fio() cin.tie(0); ios::sync_with_stdio(false);
const ll MOD = 1000000007;
// const ll MOD = 998244353;
// #define mp make_pair
//#define endl '\n'



template <typename T1, typename T2>
class LazySegmentTree {
public:
  using F = function<T1(T1&, T1&)>; // query_func
  using G = function<T2(T2&, T2&)>; // update_func
  using H = function<T1(T1&, T2&, int, int)>; // lazy to node (node, lazy, left, right)
  int n;
  vector<T1> node;
  vector<T2> lazy;
  T1 e1;
  T2 e2;
  F query_func;
  G update_func;
  H eval_func;

  LazySegmentTree(vector<T1> a, F query_func, G update_func, H eval_func, T1 e1, T2 e2)
    :query_func(query_func), update_func(update_func), eval_func(eval_func), e1(e1), e2(e2)
  {
    int _n = a.size();
    n = 1; while (n < _n) n *= 2;
    node.resize(2 * n - 1, e1);
    lazy.resize(2 * n - 1, e2);
    for (int i = 0; i < _n; i++) node[i + n - 1] = a[i];
    for (int i = n - 2; i >= 0; i--) {
      node[i] = query_func(node[i * 2 + 1], node[i * 2 + 2]);
    }
  }

  // k�Ԗڂ̃m�[�h�ɂ��Ēx���]�����s��
  inline void eval(int k, int l, int r) {
    if (lazy[k] != e2) { // Change
      node[k] = eval_func(node[k], lazy[k], l, r);
      if (r - l > 1) {
        lazy[2 * k + 1] = update_func(lazy[2*k + 1], lazy[k]);
        lazy[2 * k + 2] = update_func(lazy[2*k + 2], lazy[k]);
      }
      lazy[k] = e2; // Change
    }
  }

  // [a, b)��x�ɂ���
  void update(int a, int b, T2 x, int k, int l, int r) {
    // k �Ԗڂ̃m�[�h�ɑ΂��Ēx���]�����s��
    eval(k, l, r);
    if (b <= l || r <= a) return;
    if (a <= l && r <= b) {
      lazy[k] = update_func(lazy[k], x);
      eval(k, l, r);
    }
    else {
      update(a, b, x, 2 * k + 1, l, (l + r) / 2);
      update(a, b, x, 2 * k + 2, (l + r) / 2, r);
      node[k] = query_func(node[2 * k + 1], node[2 * k + 2]);
    }
  }

  T1 query(int a, int b, int k, int l, int r) {
    eval(k, l, r);
    if (b <= l || r <= a) return e1;
    if (a <= l && r <= b) return node[k];
    T1 resl = query(a, b, 2 * k + 1, l, (l + r) / 2);
    T1 resr = query(a, b, 2 * k + 2, (l + r) / 2, r);
    return query_func(resl, resr);
  }
};


ll f(ll a, ll b) {return (a + b) % MOD;}
ll g(ll a, ll b) {return (a + b) % MOD;}
ll h(ll a, ll b, int l, int r) {return (a + b * (r - l)) % MOD;}


ll solve(vl s, ll a, ll b) {
    int n = s.size();

    vi nex(n);
    ll last = n - 1;
    rrep (i, n) {
        if (i != n - 1) {
            if (s[i + 1] - s[i] < a) last = i;
        }
        nex[i] = last;
    }

    // vl dp(n + 1, 0);
    LazySegmentTree<ll, ll> dp(vl(n + 1), f, g, h, 0, 0);
    dp.update(0, 1, 1, 0, 0, dp.n);
    // dp[0] = 1;

    rep (i, n) {
        ll pre;
        if (i == 0) pre = -INF;
        else pre = s[i - 1];
        auto itr = lower_bound(all(s), pre + b);
        int ni = itr - s.begin();
        ll x = dp.query(i, i + 1, 0, 0, dp.n);
        dp.update(ni + 1, min(n, nex[i] + 1) + 1 + 1, x, 0, 0, dp.n);
        for (int j = ni; j <= min(n, nex[i] + 1); j++) {
            // (dp[j + 1] += dp[i]) %= MOD;
        }
    }
    // DEBUG_VEC(nex);
    // DEBUG_VEC(dp);

    ll ans = 0;
    for (int i = n; i >= 0; i--) {
        // if (i == n or nex[i] == n - 1) ans += dp[i];
        if (i == n or nex[i] == n - 1) ans += dp.query(i, i + 1, 0, 0, dp.n);
    }
    ans %= MOD;
    return ans;
}

signed main() {
    fio();
    int n;
    ll a, b;
    cin >> n >> a >> b;
    if (a > b) swap(a, b);
    vl s(n);
    rep (i, n) cin >> s[i];

    rep (i, n - 2) {
        if (s[i + 2]  - s[i] < a) {
            cout << 0 << endl;
            return 0;
        }
    }

    vll t(1);
    int bdx = 0;
    rep (i, n) {
        t[bdx].push_back(s[i]);
        if (i != n - 1 and s[i + 1] - s[i] >= b) {
            t.push_back(vl(0));
            bdx++;
        }
    }
    // DEBUG_MAT(t);

    ll ans = 1;
    rep (i, t.size()) {
        ans *= solve(t[i], a, b);
        ans %= MOD;
    }
    cout << ans << endl;
}

Measured memory_bytes: 10888