#include <iostream> #include <algorithm> using namespace std; int a[1<<20]; int main(){ int n, d, mod = 1e9 + 9; cin>>n>>d; for (int i=1;i<=n;i++) cin>>a[i]; sort(a + 1, a + n + 1); int wys = 1; for (int i=1, l=1;i<=n;i++){ while (l < i and a[l] + d < a[i]) l++; wys = 1LL * wys * (i - l + 1) % mod; } cout<<wys<<'\n'; }