////////////////////////////// Author:eldaee, coder_viper
#pragma GCC optimize ("Ofast")
#include <bits/stdc++.h>
#define int long long
#define str string
#define vec vector
#define dou double
#define ld long double
#define pb push_back
#define ppb pop_back
#define eb emplace_back
#define YES cout << "YES" << '\n'
#define Yes cout << "Yes" << '\n'
#define NO cout << "NO" << '\n'
#define No cout << "No" << '\n'
#define gcd __gcd
#define all(x) x.begin(),x.end()
#define eldaee ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;
const int mod = 1000000007;
int ans = 0;
void solve() {
int n, l;
cin >> n >> l;
vec<int> v(n);
for (auto &i : v) {
cin >> i;
}
if (n == 1) {
ans = 1;
}
else if (n == 2) {
if (abs(v[0] - v[1]) <= l) {
ans++;
}
if (abs(v[1] - v[0]) <= l) {
ans++;
}
}
else if (n == 3) {
if (abs(v[0] - v[1]) + abs(v[1] - v[2]) <= l) {
ans++;
}
if (abs(v[0] - v[2]) + abs(v[2] - v[1]) <= l) {
ans++;
}
if (abs(v[1] - v[0]) + abs(v[0] - v[2]) <= l) {
ans++;
}
if (abs(v[1] - v[2]) + abs(v[2] - v[0]) <= l) {
ans++;
}
if (abs(v[2] - v[0]) + abs(v[0] - v[1]) <= l) {
ans++;
}
if (abs(v[2] - v[1]) + abs(v[1] - v[0]) <= l) {
ans++;
}
}
cout << ans % mod << '\n';
}
signed main()
{
eldaee
solve();
}
