// Copyright (C) 2017 __debug.

// This program is free software; you can redistribute it and/or
// modify it under the terms of the GNU General Public License as
// published by the Free Software Foundation; version 3

// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
// GNU General Public License for more details.

// You should have received a copy of the GNU General Public License
// along with this program; If not, see <http://www.gnu.org/licenses/>.


#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/priority_queue.hpp>

#define x first
#define y second
#define MP std::make_pair
#define SZ(x) ((int)(x).size())
#define ALL(x) (x).begin(), (x).end()
#define DEBUG(...) fprintf(stderr, __VA_ARGS__)
#ifdef __linux__
#define getchar getchar_unlocked
#define putchar putchar_unlocked
#endif

using std::pair;
using std::vector;
using std::string;

typedef long long LL;
typedef pair<int, int> Pii;

const int oo = 0x3f3f3f3f;

template<typename T> inline bool chkmax(T &a, T b) { return a < b ? a = b, true : false; }
template<typename T> inline bool chkmin(T &a, T b) { return b < a ? a = b, true : false; }
string procStatus()
{
    std::ifstream t("/proc/self/status");
    return string(std::istreambuf_iterator<char>(t), std::istreambuf_iterator<char>());
}
template<typename T> T read(T &x)
{
    int f = 1;
    char ch = getchar();
    for (; !isdigit(ch); ch = getchar())
        f = (ch == '-' ? -1 : 1);
    for (x = 0; isdigit(ch); ch = getchar())
        x = 10 * x + ch - '0';
    return x *= f;
}
template<typename T> void write(T x)
{
    if (x == 0) {
        putchar('0');
        return;
    }
    if (x < 0) {
        putchar('-');
        x = -x;
    }
    static char s[20];
    int top = 0;
    for (; x; x /= 10)
        s[++top] = x % 10 + '0';
    while (top)
        putchar(s[top--]);
}
// EOT

const int MAXN = 1e5 + 5;
const int MOD = 1e9 + 7;

int N;
LL A, B;
LL S[MAXN];

void input()
{
    read(N); read(A); read(B);
    for (int i = 1; i <= N; ++i) {
        read(S[i]);
    }
}

void solve()
{
    static int dpA[MAXN], dpB[MAXN];

    int pA = 0, pB = 0;
    int sA = 1, sB = 1;
    dpA[0] = dpB[0] = 1;
    for (int i = 2; i <= N; ++i) {
        while (pA + 1 < i - 1 && S[i] - S[pA + 1] >= A) (sA += dpB[++pA]) %= MOD;
        while (pB + 1 < i - 1 && S[i] - S[pB + 1] >= B) (sB += dpA[++pB]) %= MOD;
        dpA[i - 1] = sA;
        dpB[i - 1] = sB;
        if (S[i] - S[i - 1] < A) {
            sB = 0;
            pB = i - 2;
        }
        if (S[i] - S[i - 1] < B) {
            sA = 0;
            pA = i - 2;
        }
    }
    while (pA + 1 < N) (sA += dpB[++pA]) %= MOD;
    while (pB + 1 < N) (sB += dpA[++pB]) %= MOD;

    int ans = (sA + sB) % MOD;

    printf("%d\n", ans);
}

int main()
{
#ifdef __DEBUG
    freopen("C.in", "r", stdin);
    freopen("C.out", "w", stdout);
#endif

    input();
    solve();

    return 0;
}

//         曾子杀彘 / 曾子烹彘
//             [先秦] 韩非
// 曾子之妻之市，其子随之而泣。
// 其母曰：“女还，顾反为女杀彘。”
// 妻子适市来，曾子欲捕彘杀之。
// 妻止之曰：“特与婴儿戏耳。”
// 曾子曰：“婴儿非与戏也。婴儿非有智也，待父母而学者也，
//          听父母之教。今子欺之，是教子欺也。
//          母欺子，子而不信其母，非所以成教也。”
// 遂烹彘也。(女 通：汝)


Measured memory_bytes: 1920