#include "bits/stdc++.h"
using namespace std;
typedef long long li;


template <long long mod>
struct modint {
    long long x;

    modint<mod>(): x(0LL) {}
    modint<mod>(const long long _data) {
        if (_data < 0) {
            x = (_data % mod + mod) % mod;
        } else if (_data >= mod) {
            x = _data % mod;
        } else {
            x = _data;
        }
    }

    bool operator==(const modint<mod>& op) const {
        return x == op.x;
    }

    bool operator!=(const modint<mod>& op) const {
        return !((*this) == op);
    }

    modint<mod> operator-() const {
        if (x == 0) {
            return modint(0);
        }
        return modint(mod - x);
    }

    modint<mod> operator+(const modint<mod>& op) const {
        const long long newdata = x + op.x;
        if (newdata >= mod) {
            return modint<mod>(newdata - mod);
        } else {
            return modint<mod>(newdata);
        }
    }

    modint<mod>& operator+=(const modint<mod>& op) {
        x = (*this + op).x;
        return *this;
    }

    modint<mod> operator-(const modint<mod>& op) const {
        return *this + (-op);
    }

    modint<mod> operator*(const modint<mod>& op) const {
        return modint<mod>(x * op.x % mod);
    }

    modint<mod> pow(const long long n) const {
        if (n == 0) {
            return modint<mod>(1);
        }
        modint<mod> sq = pow(n / 2);
        if (n & 1) {
            return (*this) * sq * sq;
        } else {
            return sq * sq;
        }
    }

    modint<mod> inverse() const {
        return pow(mod - 2);
    }

    modint<mod> operator/(const modint<mod>& op) const {
        return (*this) * op.inverse();
    }

    friend modint<mod> operator/(const long long dividend, const modint<mod>& divisor) {
        return modint<mod>(dividend) / divisor;
    }

    static modint<mod> factorial(const long long n) {
        static std::vector<modint<mod>> cache(1, 1);

        while (cache.size() <= n) {
            modint<mod> next = cache.back() * cache.size();
            cache.push_back(next);
        }
        return cache[n];
    }

    static modint<mod> combination(const long long n, const long long k) {
        if (k < 0 || n < k) {
            return modint<mod>(0);
        }

        if (n < 1e6) {
            return factorial(n) / (factorial(k) * factorial(n - k));
        }

        modint<mod> ret(1);
        for (int i = 1; i <= k; ++i) {
            ret = ret * modint<mod>(n - i + 1) / modint<mod>(i);
        }
        return ret;
    }
};

typedef modint<1000000007> mint;


int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);

    li n, a, b;
    cin >> n >> a >> b;

    li nn = n + 1;
    vector<li> xs(nn);
    for (int i = 0; i < n; ++i) {
        cin >> xs[i + 1];
    }
    xs[0] = xs[1] - max(a, b);

    li thresholds[2] = {a, b};
    vector<vector<mint>> dp(2, vector<mint>(nn)), accumulate(2, vector<mint>(nn + 1));
    dp[0][0] = dp[1][0] = 1;
    accumulate[0][1] = accumulate[1][1] = 1;

    li exclude[2] = {0, 0};
    li include[2] = {1, 1};
    for (int i = 1; i < nn; ++i) {
        for (int col = 0; col < 2; ++col) {
            const int op_col = 1 - col;

            if (xs[i] - xs[i - 1] < thresholds[col]) {
                exclude[col] = i - 1;
            }

            while (include[col] < i && (i + 1 == nn || xs[i + 1] - xs[include[col]] >= thresholds[op_col])) {
                include[col] += 1;
            }

            if (exclude[col] <= include[col]) {
                dp[col][i] += accumulate[op_col][include[col]] - accumulate[op_col][exclude[col]];
            }
            accumulate[col][i + 1] = accumulate[col][i] + dp[col][i];
        }
    }

    cout << (dp[0][nn - 1] + dp[1][nn - 1]).x << endl;
    return 0;
}

Measured memory_bytes: 4980