#include <bits/stdc++.h>
using namespace std;

#define rep(i, n) for(int i = 0; i < (n); i++)
#define repp(i, l, r) for(int i = (l); i < (r); i++)
#define per(i, n) for(int i = ((n)-1); i >= 0; i--)
#define perr(i, l, r) for(int i = ((r)-1); i >= (l); i--)
#define all(x) (x).begin(),(x).end()
#define MOD 1000000007
#define IINF 1000000000
#define LINF 1000000000000000000
#define SP <<" "<<
#define CYES cout<<"Yes"<<endl
#define CNO cout<<"No"<<endl
#define CFS cin.tie(0);ios::sync_with_stdio(false)

typedef long long LL;
typedef long double LD;

int main(){
  LL n,t;
  cin >> n >> t;
  vector<LL> x(n);
  rep(i,n){
    cin >> x[i];
  }
  sort(all(x));
  LL ans=1;
  rep(i,n){
    LL idx = lower_bound(all(x),x[i]-t)-x.begin();
    ans=ans*(i-idx+1)%MOD;
  }
  cout << ans << endl;
  return 0;
}

