#include<cstdio>
#include<cstring>
#include<vector>
#include<queue>
#include<stack>
#include<algorithm>
#include<cmath>
#include<climits>
#include<string>
#include<set>
#include<unordered_set>
#include<numeric>
#include<map>
#include<iostream>
using namespace std;
#define rep(i,n) for(int i = 0;i<((int)(n));i++)
#define reg(i,a,b) for(int i = ((int)(a));i<=((int)(b));i++)
#define irep(i,n) for(int i = ((int)(n)-1);i>=0;i--)
#define ireg(i,a,b) for(int i = ((int)(b));i>=((int)(a));i--)
typedef long long ll;
typedef pair<ll, ll> mp;
ll mod = 1e9+7;
ll inf = 1e18;

/*
ソートして尺取
*/

ll n,k,a[200010],b[200010],ans=1,r;

int main(void){
	cin>>n>>k;
	rep(i,n)cin>>a[i];
	//
	sort(a,a+n);
	r=n-1;
	//
	rep(i,n){
		while(r>=0 && a[i]+a[r]>k)r--;
		b[i]=min(r+1,(ll)i);
	}
	// rep(i,n)cout<<b[i]<<endl;
	reg(i,1,n/2){
		ans = (ans * (b[n-i]-(i-1))) % mod;
	}
	cout<<ans<<endl;
	return 0;
}