#include <bits/stdc++.h>
using namespace std;
//define
#define int long long
#define UNIQUE(v) v.erase(unique(all(v)), v.end());
#define ZIP(v) sort(all(v)),UNIQUE(v)
#define ADD(a, b) a = (a + b) % mod
#define SUB(a, b) a = (a+mod-b)%mod
#define MUL(a, b) a = (a * b) % mod
#define repi(i,m,n) for(int i = m;i < n;i++)
#define drep(i,n,m) for(int i = n;i >= m;i--)
#define rep(i,n) repi(i,0,n)
#define rrep(i,n) repi(i,1,n+1)
#define chmin(x,y) x = min(x,y)
#define chmax(x,y) x = max(x,y)
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(), v.rend()
#define dmp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define fi first
#define se second
// 許容する誤差ε
#define EPS (1e-10)
// 2つのスカラーが等しいかどうか
#define EQ(a,b) (abs((a)-(b)) < EPS)
// 2つのベクトルが等しいかどうか
#define EQV(a,b) ( EQ((a).real(), (b).real()) && EQ((a).imag(), (b).imag()) )
//typedef
typedef complex<double> Point;
typedef pair<int,int> P;
typedef pair<int, P> PP;
typedef pair<P, int> Pi;
typedef vector<int> vi;
typedef deque<int> dq;
const int inf = 1e9+7;
const int INF = 1e18+7;
//template
template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p){
  os << "(" << p.first << "," << p.second << ")";return os;
}
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v){
  for (auto it = v.begin();it != v.end();++it){
    if(it != v.begin())os << " ";os << *it;
      }return os;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, const map<T, U> &mp){
  for(auto x: mp)os << "(" << x.first << "," << x.second << ")" << endl;
  return os;
}
template<typename T, int SIZE>
int array_length(const T (&)[SIZE]){return SIZE;}
template<typename T, int N>
void PRINTF(const T (&a)[N], int s = N, int t = -1, bool f = true){
	if(t == -1){rep(i,s){if(i)cout << " ";cout << a[i];}}
	else repi(i,s,t){if(i!=s)cout << " ";cout << a[i];}
	if(f)cout << "\n";
}
template<typename T, int N1, int N2>
void PRINTF(const T (&a)[N1][N2], int h = N1, int w = N2){
	rep(i,h){rep(j,w){cout << a[i][j] << " \n"[j==w-1];}}
}

const int MAX = 200000;
int a[MAX], dp[2][MAX];
const int mod = 1e9+7;

class BIT{
public:
	int n = 1;
	vector<int> bit;
	void init(int N){	//[0, N)のBIT作成
		while(n < N+1)n *= 2;
		bit.resize(n+1);
		fill(all(bit), 0);
	}
	void add(int i, int x){
		i++;while(i <= n){bit[i] += x;i += i&-i;}
	}
	int get(int i){
		int s = 0;i++;
		while(i > 0){s += bit[i];i -= i&-i;}
		return s;
	}
  void set_zero(int i){
    add(i, -get(i));
  }
	int lower_bound(int k){
		int lb = -1, ub = n;
		while(ub-lb > 1){
			if(get((lb+ub)/2) >= k)ub = (lb+ub)/2;
			else lb = (lb+ub)/2;
		}
		return ub;
	}
};

signed main(){
  int n, A, B;
  scanf("%lld%lld%lld", &n, &A, &B);
  rrep(i,n)scanf("%lld", &a[i]);
  BIT bit[2];rep(i,2)bit[i].init(n+1);
  
  a[0] = -INF;
  dp[0][0] = dp[1][0] = 1;
  bit[0].add(0, 1);bit[1].add(0, 1);
  int zero1 = 0, zero2 = 0;
  repi(i,2,n+1){
    int p2 = upper_bound(a, a+i-1, a[i]-B)-a-1;
    if(p2 != -1){
      int s = bit[1].get(p2)%mod;
      dp[0][i-1] = s;bit[0].add(i-1, s);
    }
    int p1 = upper_bound(a, a+i-1, a[i]-A)-a-1;
    if(p1 != -1){
      int s = bit[0].get(p1)%mod;
      dp[1][i-1] = s;bit[1].add(i-1, s);
    }
    if(a[i]-a[i-1] < A){
      while(zero2 < i-1){dp[1][zero2] = 0;bit[1].set_zero(zero2);zero2++;}
    }
    if(a[i]-a[i-1] < B){
      while(zero1 < i-1){dp[0][zero1] = 0;bit[0].set_zero(zero1);zero1++;}
    }
  }
  
  // PRINTF(dp, 2, 5);
  int ans = 0;
  rep(i,n){ans += dp[0][i]+dp[1][i];ans %= mod;}
  cout << ans << endl;
	return 0;
}










Measured memory_bytes: 5632