#include <bits/stdc++.h>
#define rf(x) (x)=0;while(*p<48)p++;while(47<*p)(x)=((x)<<3)+((x)<<1)+(*p++&15);
//#define rf(x) (x)=0;while(*p<48)im=*p=='-';while(47<*p)(x)=((x)<<3)+((x)<<1)+(*p++&15);if(im)(x)=-(x);
#define pb push_back
#define eb emplace_back
#define sz(V) ((int)(V).size())
#define allv(V) ((V).begin()),((V).end())
#define befv(V) ((V)[(sz(V)-2)])
#define sorv(V) sort(allv(V))
#define revv(V) reverse(allv(V))
#define univ(V) (V).erase(unique(allv(V)),(V).end())
#define clv(V) (V).clear()
#define upmin(a,b) (a)=min((a),(b))
#define upmax(a,b) (a)=max((a),(b))
#define rb(x) ((x)&(-(x)))
#define cb(x) (x)=(!(x))
#define INF (0x3f3f3f3f)
#define INFLL (0x3f3f3f3f3f3f3f3fll)
#define INFST (0x7f7f7f7f)
#define INFLLST (0x7f7f7f7f7f7f7f7fll)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<int, ll> pil;
typedef pair<ll, int> pli;
typedef pair<ld, ld> pdd;
typedef complex<ld> base;
const ld EPS = (ld)1e-7;
const ld PI = acos(0) * 2;
bool isZero(const ld& x) { return abs(x) <= EPS; }
int sign(const ld& x) { return isZero(x) ? 0 : (0 < x ? 1 : -1); }
ll gcd(ll a, ll b) { for(;b;a%=b,swap(a,b)){} return abs(a); }
pll operator + (const pll& a, const pll& b) { return pll(a.first+b.first, a.second+b.second); }
pll operator - (const pll& a, const pll& b) { return pll(a.first-b.first, a.second-b.second); }
pll operator * (const pll& a, const ll& b) { return pll(a.first*b, a.second*b); }
ll operator * (const pll& a, const pll& b) { return a.first*b.second - b.first*a.second; }
ll ccw(const pll& a, const pll& b, const pll& c) { return a*b + b*c + c*a; }
void fg(vector<int> G[], int a, int b) { G[a].pb(b); G[b].pb(a); }
void fg(vector<pii> G[], int a, int b, int c) { G[a].pb({b, c}); G[b].pb({a, c}); }

const int MOD = 1000000007;
const int MAXN = 100005;
const int MX = 131072;

struct SEG {
	SEG() { init(); }
	ll d[MX*2];
	void init() { fill(d, d+MX*2, INFLL); }
	void upd(int x, ll r) {
		x += MX; d[x] = r;
		for(x /= 2; x; x /= 2)
			d[x] = min(d[x*2], d[x*2+1]);
	}
	ll get(int s, int e) {
		ll r = INFLL; for(s += MX, e += MX; s <= e; s /= 2, e /= 2) {
			if(s&1) upmin(r, d[s++]); if(~e&1) upmin(r, d[e--]);
		} return r;
	}
} seg;

ll dp[MAXN], dps[MAXN];

ll A[MAXN];

ll X, Y, Ans;
int N;

int main() {
	ios::sync_with_stdio(false);

	cin >> N >> X >> Y;
	if(Y > X) swap(X, Y);
	for(int i = 1; i <= N; i++) cin >> A[i];
	A[0] = -INFLL;

	for(int i = 1; i+2 <= N; i++) {
		if(A[i+2] - A[i] < Y) {
			puts("0");
			return 0;
		}
	}

	for(int i = 1; i < N; i++) seg.upd(i, A[i+1] - A[i]);

	dp[0] = dps[0] = 1;
	for(int i = 1; i <= N; i++) {
		int uj = min(i-1, (int)(upper_bound(A, A+i, A[i]-X)-A-1));
		int s = 1, e = i-1; for(int m; s < e;) {
			m = (s+e)/2;
			if(seg.get(m, i-2) >= Y) e = m;
			else s = m+1;
		}
		int lj = max(0, s-1);
		//printf("%d : %d %d\n", i, lj, uj);
		// lj <= j <= uj
		dp[i] = lj > uj ? 0 : dps[uj] - (lj ? dps[lj-1] : 0);
		dp[i] = ((dp[i] % MOD) + MOD) % MOD;
		dps[i] = dps[i-1] + dp[i];
		dps[i] = ((dps[i] % MOD) + MOD) % MOD;
		//printf("%d  : %lld\n", i, dp[i]);
	}

	for(int i = 1; i <= N; i++) {
		ll t = seg.get(i, N-1);
		if(Y <= t) Ans = (Ans + dp[i-1]) % MOD;
	}
	Ans = (Ans + dp[N]) % MOD;

	cout << (Ans % MOD) << endl;
	return 0;
}

Measured memory_bytes: 4608