#include<bits/stdc++.h> using namespace std; using i64 = long long; #define int i64 #define vi vector<int> #define vvi vector<vi> #define vb vector<bool> #define pii pair<int, int> #define fi first #define se second #define sz(x) (int)(x).size() const int MOD = 1e9 + 9; inline void solve(){ int n, d, ans = 1; cin >> n >> d; vi a(n); for(int &i : a){ cin >> i; } sort(a.begin(), a.end()); for(int le = 0, ri = 0; le < n; le++){ while(ri < n - 1 && a[ri + 1] - a[le] <= d) ri++; ans = (ans * (ri - le + 1)) % MOD; } cout << ans << "\n"; return; } signed main(){ ios_base::sync_with_stdio(false); cin.tie(0); int t = 1; //cin >> t; while(t--){ solve(); } return 0; }