#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("unroll-loops")
//#pragma warning(disable : 4996)

#ifdef _MSC_VER
#include <intrin.h>
#define __builtin_popcount __popcnt
#define __builtin_popcountll __popcnt64
#endif

#include <limits.h>
#include <math.h>
#include <time.h>

#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>

using namespace std;

#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (int i = m; i < n; ++i)
#define FORR(i, m, n) for (int i = m - 1; i >= n; --i)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define REVERSE(v, n) reverse(v, v + n);
#define VREVERSE(v) reverse(v.begin(), v.end())
#define ll long long
#define print(x) cout << (x) << '\n'
#define pe(x) cout << (x) << " "
#define DEBUG(x) cout << #x << ": " << x << endl
#define lb(v, n) lower_bound(v.begin(), v.end(), (n))
#define ub(v, n) upper_bound(v.begin(), v.end(), (n))
#define int long long
#define double long double
#define all(x) (x).begin(), (x).end()
#define print_space(v) REP(i, v.size()) cout << v[i] << ((i == v.size() - 1) ? "\n" : " ")
template <typename T1, typename T2> inline void chmin(T1& a, T2 b) {
	if (a > b) a = b;
}
template <typename T1, typename T2> inline void chmax(T1& a, T2 b) {
	if (a < b) a = b;
}
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef array<int, 3> arr3;
std::random_device rd;
std::mt19937 mt(rd());
constexpr ll MOD = 1e9 + 7;
constexpr int MAX = 500050;
const double pi = acos(-1);
constexpr double EPS = 1e-8;
constexpr ll LINF = 1e18 + 1;
constexpr int INF = 1e9 + 1;

const int mod = 1000000007;
struct mint {
	ll x; // typedef long long ll;
	mint(ll x = 0) :x((x%mod + mod) % mod) {}
	mint operator-() const { return mint(-x); }
	mint& operator+=(const mint a) {
		if ((x += a.x) >= mod) x -= mod;
		return *this;
	}
	mint& operator-=(const mint a) {
		if ((x += mod - a.x) >= mod) x -= mod;
		return *this;
	}
	mint& operator*=(const mint a) { (x *= a.x) %= mod; return *this; }
	mint operator+(const mint a) const { return mint(*this) += a; }
	mint operator-(const mint a) const { return mint(*this) -= a; }
	mint operator*(const mint a) const { return mint(*this) *= a; }
	mint pow(ll t) const {
		if (!t) return 1;
		mint a = pow(t >> 1);
		a *= a;
		if (t & 1) a *= *this;
		return a;
	}

	// for prime mod
	mint inv() const { return pow(mod - 2); }
	mint& operator/=(const mint a) { return *this *= a.inv(); }
	mint operator/(const mint a) const { return mint(*this) /= a; }
};
istream& operator>>(istream& is, const mint& a) { return is >> a.x; }
ostream& operator<<(ostream& os, const mint& a) { return os << a.x; }

template<typename T>
struct SegmentTree {
	int n;
	T unit;
	vector<T>dat;
	function<T(T, T)> func;
	SegmentTree(const int N, T _unit, function<T(T, T)> _func)
		:unit(_unit), func(_func) {
		n = 1;
		//簡単のため、要素数を2のべき乗に
		while (n < N)n *= 2;
		dat.assign(2 * n, unit);
	}

	void update(int k, T a) {
		k += n - 1;//葉の節点
		dat[k] = a;
		//上りながら更新
		while (k > 0) {
			k = (k - 1) / 2;
			dat[k] = func(dat[k * 2 + 1], dat[k * 2 + 2]);
		}
	}
	T _query(int a, int b, int k, int l, int r) {
		//[a,b)と[l,r)が交差していなければ、funcに影響を与えない値を返す
		if (r <= a || b <= l)return unit;
		//[a,b)が[l,r)を完全に含んでいれば、この節点の値
		if (a <= l && r <= b)return dat[k];
		else {
			T vl = _query(a, b, k * 2 + 1, l, (l + r) / 2);
			T vr = _query(a, b, k * 2 + 2, (l + r) / 2, r);
			return func(vl, vr);
		}
	}
	//[a,b)
	T query(int a, int b) {
		return _query(a, b, 0, 0, n);
	}
};
//auto f = [](int a, int b) {return a + b; };
//SegmentTree<int>seg(N,0,f);

void solve() {
	int N, A, B; cin >> N >> A >> B;
	vector<int>S(N);
	REP(i, N)cin >> S[i];

	auto f = [](mint a, mint b) {return a + b; };
	SegmentTree<mint>dpA(N + 1, 0, f), dpB(N + 1, 0, f);
	set<int>addedA, addedB;//addされた場所
	dpA.update(0, 1);//dpA[i][j]=i番目がAで，最後のBがj-1番目の時の場合の数(j==0の時は未使用)
	dpB.update(0, 1);
	addedA.insert(0);
	addedB.insert(0);
	REP(i, N-1) {
		//Aの遷移
		auto rb = ub(S, S[i + 1] - B) - S.begin()+1;
		int posB = i+1;
		mint valB = dpA.query(0, rb);

		//B
		auto ra = ub(S, S[i + 1] - A) - S.begin()+1;
		int posA = i+1;
		mint valA = dpB.query(0, ra);

		//clear
		if (S[i + 1] - S[i] < A) {
			auto itr = addedA.begin();
			while (itr != addedA.end()) {
				dpA.update(*itr, 0);
				itr = addedA.erase(itr);
			}
			if (dpA.query(0, N + 1).x != 0) {
				REP(j, N + 1) {
					pe(j); print(dpA.query(j, j + 1));
				}
				exit(1);
			}
		}
		if (S[i + 1] - S[i] < B) {
			auto itr = addedB.begin();
			while (itr != addedB.end()) {
				dpB.update(*itr, 0);
				itr = addedB.erase(itr);
			}
			if (dpB.query(0, N + 1).x != 0) {
				REP(j, N + 1) {
					pe(j); print(dpB.query(j, j + 1));
				}
				exit(1);
			}
		}
		addedA.insert(posA);
		addedB.insert(posB);
		dpA.update(posA, dpA.query(posA, posA + 1) + valA);
		dpB.update(posB, dpB.query(posB, posB + 1) + valB);

		//DEBUG(i);
		//cerr << "dpA:" << endl;
		//REP(j, N + 1) {
		//	cerr << dpA.query(j, j + 1) << " ";
		//}cerr << endl;
		//cerr << "dpB:" << endl;
		//REP(j, N + 1) {
		//	cerr << dpB.query(j, j + 1) << " ";
		//}cerr << endl;
	}
	mint ans = 0;
	ans += dpA.query(0, N+1);
	ans += dpB.query(0, N+1);
	print(ans);
}



signed main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	//mt.seed((int)(time(0)));
	//REP(_, 10000)test();
	//int q;
	//cin >> q;
	//while (q--)
	solve();
}



Measured memory_bytes: 14592