#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
 
int main()
{
	int n, m;
	cin >> n >> m;
	vector<int> v(n);
	for (int i = 0; i < n; i++) {
		cin >> v[i];
	}
	sort(v.begin(), v.end());
	const int mod = (int)1e9+9;
	int ans = 1;
	int l = 0;
	for (int r = 0; r < n; r++) {
		while (v[l] < v[r] - m) { l++; }
		ans = (long long)ans * (r-l+1) % mod;
	}
	cout << ans << endl;
}