#include<bits/stdc++.h>

using namespace std;

int N, nd[2], bg[2], dp[100009][2], s[100009][2];
long long v[100009], df[2];
const int mod = 1e9 + 7;

int add (int x, int y) {int ans = x + y; if (ans >= mod) ans -= mod; return ans;}
int subtract (int x, int y) {if (x >= y) return x - y; return x - y + mod;}

int main ()
{
scanf ("%d %lld %lld", &N, &df[0], &df[1]);
for (int i=1; i<=N; i++)
    scanf ("%lld", &v[i]), v[N + 1] = 2e18 + v[N];
dp[0][0] = dp[0][1] = s[0][0] = s[0][1] = 1;
for (int i=1; i<=N; i++)
    for (int j=0; j<2; j++)
    {
        while (v[i + 1] - v[nd[j] + 1] >= df[j ^ 1] && nd[j] + 1 < i) nd[j] ++;
        if (i > 1 && v[i] - v[i - 1] >= df[j]) ;
        else bg[j] = i - 1;
        if (bg[j] <= nd[j])
            dp[i][j] = subtract (s[nd[j]][j ^ 1], (bg[j] ? s[bg[j] - 1][j ^ 1] : 0));
        s[i][j] = add (s[i - 1][j], dp[i][j]);
    }
printf ("%d\n", add (dp[N][0], dp[N][1]));
return 0;
}
