#include<cstdio>

#include<cstring>

#include<iostream>

#include<algorithm>

#define mod 1000000009

using namespace std;

int n,d;

int num[];

int l,r,mid,ll,rr;

long long ans=;

bool judge(int i){

    if(num[mid]<=num[i])    return true;

    else return false;

}

bool juddge(int i){

    if(num[mid]<=num[i]+d)    return true;

    else return false;

}

int main(){

    scanf("%d%d",&n,&d);

    for(int i=;i<=n;i++)

        scanf("%d",&num[i]);

    sort(num+,num++n);

    for(int i=;i<=n;i++){

        l=;r=n;

        while(l<=r){

            mid=(l+r)/;

            if(judge(i))    l=mid+;

            else r=mid-;

        }

        ll=;rr=n;

        while(ll<=rr){

            mid=(ll+rr)/;

            if(juddge(i))    ll=mid+;

            else rr=mid-;

        }

        ans=ans*(ll-l+)%mod;

    }

    cout<<ans;

}