#include <bits/stdc++.h>

#define F(i, a, b) for (LL i = a; i <= b; i ++)
#define G(i, a, b) for (LL i = a; i >= b; i --)
#define add(a, b) ((a) = (a + b) % Mo)

typedef long long LL;
 
const LL N = 1e5 + 10;
const LL Mo = 1e9 + 7;
const LL inf = 5e18;

using namespace std;

LL n, A, B, L1,R1, L2,R2;
LL S[N], f[N][2], S0[N],S1[N];

int main() {	
	scanf("%lld %lld %lld", &n, &A, &B);
	F(i, 1, n) scanf("%lld", &S[i]);
	sort(S + 1, S + n + 1);
	S[n + 1] = inf, S[0] = - inf;
	S0[0] = S1[0] = f[0][0] = f[0][1] = 1;
	F(i, 1, n) {
		// Update f[i][0]
		while (R1 < i - 1 && S[R1 + 1] <= S[i + 1] - B)
			R1 ++;
		if (S[i] - A < S[i - 1])
			L1 = i - 1;
		if (R1 >= L1) add(f[i][0], S1[R1] - (L1 ? S1[L1 - 1] : 0));
		// Update f[i][1]
		
		while (R2 < i - 1 && S[R2 + 1] <= S[i + 1] - A)
			R2 ++;
		if (S[i] - B < S[i - 1])
			L2 = i - 1;
		if (R2 >= L2) add(f[i][1], S0[R2] - (L2 ? S0[L2 - 1] : 0));
			
		S1[i] = (S1[i - 1] + f[i][1]) % Mo;
		S0[i] = (S0[i - 1] + f[i][0]) % Mo;
	}
	printf("%lld\n", ((f[n][0] + f[n][1]) % Mo + Mo) % Mo);
}