#include <bits/stdc++.h>
using namespace std;
#define finish(x) return cout << x << endl, 0
#define ll long long

const int N = 100001;

int n, dp[N], cnt[N], mod = 1e9 + 7;
ll A, B;
vector <ll> a;

int solve(int idx){
    if(idx == n) return 1;
    int &ret = dp[idx];
    if(ret != -1) return ret;
    ret = 0;
    int j = lower_bound(a.begin(), a.end(), a[idx] + A) - a.begin();
    bool ok = (idx == 0 || idx == n - 1 || a[idx + 1] - a[idx - 1] >= B);
    if(idx + 2 < j){
        ok &= cnt[j - 1] - cnt[idx + 1] == j - idx - 2;
    }
    if(ok) ret = solve(j);
    if(idx == 0 || a[idx] - a[idx - 1] >= B){
        ret += solve(idx + 1);
        if(ret >= mod) ret -= mod;
    }
    return ret;
}
int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    memset(dp, -1, sizeof dp);
    cin >> n >> A >> B;
    if(A < B) swap(A, B);
    a.resize(n);
    for(auto &i : a) cin >> i;
    for(int i = 1 ; i < n ; i++){
        cnt[i] = cnt[i - 1] + (a[i] - a[i - 1] >= B);
    }
    cout << solve(0) << endl;
}
