#include <bits/stdc++.h>
using namespace std;

#define ms(s, n) memset(s, n, sizeof(s))
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define FORd(i, a, b) for (int i = (a) - 1; i >= (b); i--)
#define FORall(it, a) for (__typeof((a).begin()) it = (a).begin(); it != (a).end(); it++)
#define FORalld(it, a) for (__typeof((a).rbegin()) it = (a).rbegin(); it != (a).rend(); it++)
#define sz(a) int((a).size())
#define present(t, x) (t.find(x) != t.end())
#define all(a) (a).begin(), (a).end()
#define uni(a) (a).erase(unique(all(a)), (a).end())
#define pb push_back
#define pf push_front
#define mp make_pair
#define fi first
#define se second
#define prec(n) fixed<<setprecision(n)
#define bit(n, i) (((n) >> (i)) & 1)
#define bitcount(n) __builtin_popcountll(n)
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pi;
typedef vector<int> vi;
typedef vector<pi> vii;
const int MOD = (int) 1e9 + 7;
const int INF = (int) 1e9;
const ll LINF = (ll) 1e18;
const ld PI = acos((ld) -1);
const ld EPS = 1e-9;
inline ll gcd(ll a, ll b) {ll r; while (b) {r = a % b; a = b; b = r;} return a;}
inline ll lcm(ll a, ll b) {return a / gcd(a, b) * b;}
inline ll fpow(ll n, ll k, int p = MOD) {ll r = 1; for (; k; k >>= 1) {if (k & 1) r = r * n % p; n = n * n % p;} return r;}
template<class T> inline int chkmin(T& a, const T& val) {return val < a ? a = val, 1 : 0;}
template<class T> inline int chkmax(T& a, const T& val) {return a < val ? a = val, 1 : 0;}
template<class T> inline T isqrt(T k) {T r = sqrt(k) + 1; while (r * r > k) r--; return r;}
template<class T> inline T icbrt(T k) {T r = cbrt(k) + 1; while (r * r * r > k) r--; return r;}
inline void addmod(int& a, int val, int p = MOD) {if ((a = (a + val)) >= p) a -= p;}
inline void submod(int& a, int val, int p = MOD) {if ((a = (a - val)) < 0) a += p;}
inline int mult(int a, int b, int p = MOD) {return (ll) a * b % p;}
inline int inv(int a, int p = MOD) {return fpow(a, p - 2, p);}
inline int sign(ld x) {return x < -EPS ? -1 : x > +EPS;}
inline int sign(ld x, ld y) {return sign(x - y);}

const int maxn = 1000000 + 10;
int n;
long long a[2];
long long s[maxn];
int dp[maxn][2];
int suf[maxn][2];

void solve() {
	cin >> n;
	cin >> a[0] >> a[1];
	FOR(i, 0, n) cin >> s[i];
	s[n] = LINF + LINF;
	dp[n][0] = dp[n][1] = suf[n][0] = suf[n][1] = 1;
	dp[n - 1][0] = dp[n - 1][1] = 1;
	suf[n - 1][0] = suf[n - 1][1] = 2;
	int l[2], r[2];
	FOR(i, 0, 2) l[i] = r[i] = n - 1;
	FORd(i, n - 1, 0) {
		FOR(j, 0, 2) {
			while (l[j] > i && s[l[j]] - (i > 0 ? s[i - 1] : -LINF) >= a[j ^ 1]) l[j]--;
			if (s[i + 1] - s[i] < a[j]) r[j] = i;
		}
		FOR(j, 0, 2) {
			if (l[j] <= r[j] && s[l[j] + 1] - (i > 0 ? s[i - 1] : -LINF) >= a[j ^ 1]) {
				addmod(dp[i][j], suf[l[j] + 1][j ^ 1]);
				submod(dp[i][j], suf[r[j] + 2][j ^ 1]);
			}
			suf[i][j] = suf[i + 1][j];
			addmod(suf[i][j], dp[i][j]);
		}
	}
	int ans = 0;
	addmod(ans, dp[0][0]);
	addmod(ans, dp[0][1]);
	cout << ans << "\n";
}

int main() {
	ios_base::sync_with_stdio(0); cin.tie(0);
#ifdef _LOCAL_
	freopen("in.txt", "r", stdin); //freopen("out.txt", "w", stdout);
#endif
	solve();
#ifdef _LOCAL_
	//printf("\nTime elapsed: %dms", 1000 * clock() / CLOCKS_PER_SEC);
#endif
	return 0;
}

Measured memory_bytes: 2560