import std.conv, std.functional, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.container, std.math, std.numeric, std.range, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


enum MO = 10L^^9 + 7;

int N;
long K;
long[] A;

void main() {
  try {
    for (; ; ) {
      N = readInt();
      K = readLong();
      A = new long[N];
      foreach (i; 0 .. N) {
        A[i] = readLong();
      }
      
      A.sort;
      const m = A.binarySearch!(a => (2 * a > K));
      debug {
        writeln("A = ", A);
        writeln("m = ", m);
      }
      long ans;
      if (m >= N - m) {
        ans = 1;
        int i = 0;
        foreach_reverse (j; m .. N) {
          for (; i < m && A[i] + A[j] <= K; ++i) {}
          ans *= (i - (N - 1 - j));
          ans %= MO;
        }
        for (int k = m - (N - m) - 1; k > 1; k -= 2) {
          ans *= k;
          ans %= MO;
        }
      }
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}