//c++ -std=gnu++14 a.cpp
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iostream>
#include <istream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <tuple>
#include <iomanip>
#include <climits>
#include <fstream>
#include <random>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
//typedef pair<ll, ll> P;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define revrep(i, n) for(int i = (n)-1; i >= 0; i--)
#define pb push_back
#define f first
#define s second
#define chmin(x, y) x = min(x, y);
#define chmax(x, y) x = max(x, y);
#define sz(x) ((int)(x).size())

//const ll INFL = LLONG_MAX;//10^18 = 2^60
const ll INFL = 1LL<<60;
//const int INF = INT_MAX;
const int INF = 1 << 30;//10^9
const int MOD = 1000000007;
//const int MOD = 998244353;
//int MOD = 1000000007;
double EPS = 1e-10;

vector<ll> dy = {0, 1, 0, -1, 1, 1, -1, -1, 0};
vector<ll> dx = {1, 0, -1, 0, 1, -1, 1, -1, 0};

void pres(double A){printf("%.12lf\n", A);}
void BinarySay(ll x, ll y = 60){rep(i, y) cout << (x>>(y-1-i) & 1); cout << endl;}
ll cnt_bit(ll x){return __builtin_popcountll(x);}

ll pow_long(ll x, ll k){
  ll res = 1;
  while(k > 0){
    if(k % 2) res *= x;
    x *= x; k /= 2;
  }
  return res;
}

ll pow_mod(ll x, ll k){
  x %= MOD;
  ll res = 1;
  while(k > 0){
    if(k % 2){
      res *= x; res %= MOD;
    }
    x *= x; x %= MOD;
    k /= 2;
  }
  return res;
}

ll inverse(ll x){return pow_mod(x, MOD - 2);};

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

ll lcm(ll x, ll y){
  ll res = x / gcd(x, y);
  res *= y;
  return res;
};


//コンビネーション
const int MAXcomb = 200010;
ll fac[MAXcomb], finv[MAXcomb], inv[MAXcomb];
//facはn!,finvは1/n!
//invは逆元
void COMinit(){
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    for(int i = 2; i < MAXcomb; i++){
        fac[i] = fac[i-1] * i % MOD;
        inv[i] = MOD - inv[MOD%i] * (MOD/i) % MOD;
        finv[i] = finv[i-1] * inv[i] % MOD;
    }
}
ll comb(int n, int k){
    if(n < k) return 0;
    if(n < 0 || k < 0) return 0;
    return fac[n] * finv[k] % MOD * finv[n-k] % MOD;
}

const int MAXkai = 200010;
ll kai_memo[MAXkai];
ll kai(ll N){
  if(kai_memo[N] != 0) return kai_memo[N];
  if(N <= 1) return 1;
  return kai_memo[N] = N * kai(N-1) % MOD;
}

ll disit(ll s, ll base = 10){
  ll res = 0;
  while(s){
    res++;
    s /= base;
  }
  return res;
}

//約数の列挙O(√n)
vector<ll> divisor(ll n){
    vector<ll> res(0);
    for(ll i = 1; i * i <= n; i++){
        if(n % i == 0){
            res.push_back(i);
            if(i != n/i) res.push_back(n/i);
        }
    }
    sort(res.begin(), res.end());
    return res;
}


//区間変更、区間最大
const ll N_ = 1<<18;
ll seg[2 * N_ - 1], lazy[2 * N_ - 1];

void init_seg(){
  rep(i, 2 * N_ - 1) lazy[i] = -1;
}

void eval(ll k, ll l, ll r){
  if(lazy[k] == -1) return;
  seg[k] = lazy[k] * (r - l) % MOD;
  if(r - l > 1){
    lazy[2 * k + 1] = lazy[k];
    lazy[2 * k + 2] = lazy[k];
  }
  lazy[k] = -1;
}

void update(ll a, ll b, ll x, ll k = 0, ll l = 0, ll r = N_){
  eval(k, l, r);
  if(r <= a || b <= l) return;
  if(a <= l && r <= b){
    lazy[k] = x;
    eval(k, l, r);
    return;
  }
  update(a, b, x, 2 * k + 1, l, (l + r) / 2);
  update(a, b, x, 2 * k + 2, (l + r) / 2, r);
  eval(k, l, r);
  seg[k] = (seg[2 * k + 1] + seg[2 * k + 2]) % MOD;
  return;
}

ll getsum(ll a, ll b, ll k = 0, ll l = 0, ll r = N_){
  if(r <= a || b <= l) return 0;
  eval(k, l, r);
  if(a <= l && r <= b) return seg[k];
  ll left = getsum(a, b, 2 * k + 1, l, (l + r) / 2);
  ll right = getsum(a, b, 2 * k + 2, (l + r) / 2, r);
  return (left + right) % MOD;
}



int N;
ll A, B;
ll S[100010];
void solve(){
  cin >> N >> A >> B;
  if(A > B) swap(A, B);
  S[0] = -INFL;
  rep(i, N) cin >> S[i+1];
  bool out = 0;
  rep(i, N-1)if(S[i+2] - S[i] < A) out = 1;
  if(out){
    cout << 0 << endl;
    return;
  }


  update(0, 1, 1);
  for(int i = 1; i <= N; i++){
    int ok = 0, ng = i;
    while(ng - ok > 1){
      int mid = (ok + ng) / 2;
      if(S[i] - S[mid] >= B) ok = mid;
      else ng = mid;
    }
    ll sum = getsum(0, ok+1);
    update(i, i+1, sum);
    if(S[i] - S[i-1] < A){
      update(0, i-1, 0);
    }
  }
  cout << getsum(0, N+1) << endl;
}

int main(){
  ios_base::sync_with_stdio(0);
  cin.tie(0), cout.tie(0);
  solve();
}


Measured memory_bytes: 7808