#include <bits/stdc++.h> using namespace std; #define int long long #define fi first #define se second #define pb pushback mt19937 rng((int)chrono::steady_clock::now().time_since_epoch().count()); int hashp = uniform_int_distribution<int>(10, 1e9)(rng); int hashm1 = 1e9+7; int hashm2 = 1e9+9; int MOD = 1e9+7; int MV = 1e18; void solve(){ int n, d; cin >> n >> d; int res = 1; vector<int> a(n), p(n+1, 1); for(int i = 0; i < n; i++) cin >> a[i]; sort(a.begin(), a.end(), greater<>()); for(int i = 1; i <= n; i++){ p[i] = p[i-1]*i; p[i] %= MOD; } for(int i = 0; i < n; i++){ int j = i; while(j+1 < n && a[j+1]+d >= a[i]){ j++; } res *= p[j-i+1]; if(i != j) i = j-1; } cout << res; } signed main(){ ios::sync_with_stdio(false); cin.tie(nullptr); solve(); return 0; }