#include <bits/stdc++.h> using namespace std; #define int long long #define fi first #define se second #define pb push_back 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+9; int MV = 1e18; void solve(){ int n, d; cin >> n >> d; int res = 1; vector<int> a(n); for(int i = 0; i < n; i++) cin >> a[i]; sort(a.begin(), a.end()); int l = 0; for(int r = 0; r < n; r++){ while(l < r && a[r] > a[l]+d) l++; res *= (r-l+1); res %= MOD; } cout << res; } signed main(){ ios::sync_with_stdio(false); cin.tie(nullptr); solve(); return 0; }