#define taskname "test"

#include <bits/stdc++.h>

using namespace std;

#define sz(x) (int)x.size()
#define fi first
#define se second

typedef long long lli;
typedef pair<int, int> pii;

const int maxn = 1e5 + 5;
const int mod = 1e9 + 7;
const lli inf = 2e18;

int n;
lli a, b;
lli s[maxn], diff[maxn];

int dp[maxn][2];

struct segment_tree
{
    lli val[maxn * 4];

    void build(int x, int l, int r)
    {
        if(l == r)
        {
            val[x] = diff[l];
            return;
        }
        int mid = (l + r) / 2;
        build(x * 2, l, mid);
        build(x * 2 + 1, mid + 1, r);
        val[x] = min(val[x * 2], val[x * 2 + 1]);
    }

    lli get(int x, int l, int r, int L, int R)
    {
        if(L > R || L > r || l > R) return inf;
        if(l >= L && r <= R)
            return val[x];
        int mid = (l + r) / 2;
        return min(get(x * 2, l, mid, L, R),
                   get(x * 2 + 1, mid + 1, r, L, R));
    }
} tree_diff;

int add(int x, int y)
{
    x += y;
    if(x >= mod) x -= mod;
    else if(x < 0) x += mod;
    return x;
}

struct fenwick
{
    int val[2][maxn];

    void init()
    {
        fill_n(&val[0][0], sizeof(val) / sizeof(val[0][0]), 0);
    }

    void update(int x, int state, int k)
    {
        for(; x < maxn; x += x & -x)
            val[state][x] = add(val[state][x], k);
    }

    int get(int x, int state)
    {
        int res = 0;
        for(; x > 0; x -= x & -x)
            res = add(res, val[state][x]);
        return res;
    }

    int get(int l, int r, int state)
    {
        if(l > r) return 0;
        return add(get(r, state), -get(l - 1, state));
    }

    int get_all(int l, int r)
    {
        if(l > r) return 0;
        int res = 0;
        for(int i = 0; i < 2; ++i)
            res = add(res, get(l, r, i));
        return res;
    }
} tree_total;

void read_input()
{
    cin >> n >> a >> b;
    if(a > b) swap(a, b);
    for(int i = 1; i <= n; ++i)
        cin >> s[i];
    s[n + 1] = inf;
    s[0] = -inf;
}

void init()
{
    for(int i = 1; i <= n; ++i)
        diff[i] = s[i + 1] - s[i];
    tree_diff.build(1, 1, n);
    tree_total.init();
}

bool check(int i, int j)
{
    lli min_diff = tree_diff.get(1, 1, n, i + 1, j - 2);
    if(i > 1) min_diff = min(min_diff, s[i + 1] - s[i - 1]);
    return min_diff >= a;
}

void solve()
{
    fill_n(&dp[0][0], sizeof(dp) / sizeof(dp[0][0]), 0);
    dp[1][0] = 1;
    tree_total.update(1, 0, 1);
    for(int i = 2; i <= n; ++i)
    {
        int r = upper_bound(s + 1, s + n + 1, s[i] - b) - s;
        r = min(r, i - 1); --r;
        int low = 1, high = r, l;
        while(low <= high)
        {
            int mid = (low + high) / 2;
            if(check(mid, i)) high = mid - 1;
            else low = mid + 1;
        }
        l = low;
        dp[i][0] = tree_total.get_all(l, r);
        if(check(0, i)) dp[i][0] = add(dp[i][0], 1);
        if(s[i] - s[i - 1] >= b) dp[i][1] = add(dp[i - 1][1], dp[i - 1][0]);
        tree_total.update(i, 0, dp[i][0]);
        tree_total.update(i, 1, dp[i][1]);
    }
    int ans = 0;
    for(int i = 1; i <= n; ++i)
    {
        if(check(i, n + 1)) ans = add(ans, dp[i][0]);
        if(tree_diff.get(1, 1, n, i + 1, n - 1) >= a) ans = add(ans, dp[i][1]);
    }
    if(check(0, n + 1)) ans = add(ans, 1);
    cout << ans << '\n';
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    read_input();
    init();
    solve();
}


Measured memory_bytes: 8852