#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>

#include <iostream>
#include <complex>
#include <string>
#include <algorithm>
#include <numeric>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>

#include <functional>
#include <cassert>

typedef long long ll;
using namespace std;

#ifndef LOCAL
#define debug(x) ;
#else
#define debug(x) cerr << __LINE__ << " : " << #x << " = " << (x) << endl;

template <typename T1, typename T2>
ostream &operator<<(ostream &out, const pair<T1, T2> &p) {
  out << "{" << p.first << ", " << p.second << "}";
  return out;
}

template <typename T>
ostream &operator<<(ostream &out, const vector<T> &v) {
  out << '{';
  for (const T &item : v) out << item << ", ";
  out << "\b\b}";
  return out;
}
#endif

#define mod 1000000007 //1e9+7(prime number)
#define INF 1000000000 //1e9
#define LLINF 2000000000000000000LL //2e18
#define SIZE 200010


int main(){
  int N, K, a[SIZE];

  scanf("%d%d", &N, &K);

  for(int i=0;i<N;i++){
    scanf("%d", a+i);
  }

  sort(a, a+N, greater<int>());

  ll ans = 1;
  int t = 0;
  int i;
  for(i=0;i<N && a[i]*2 > K;i++){
    while(a[N-t-1] + a[i] <= K) t++;

    ans *= t - i;
    ans %= mod;
  }


  N -= i*2;
  debug(N);

  for(int i=0;i<N/2;i++){
    ans *= N - i * 2 - 1;
    ans %= mod;
  }

  cout << ans << endl;

  return 0;
}