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

immutable long MOD = 10^^9 + 7;
long[] P2, F, G;

void main() {
    auto s = readln.split.map!(to!int);
    auto N = s[0];
    auto K = s[1];
    auto A = readln.split.map!(to!long).array;
    A.sort();

    P2 = new long[](N+1);
    F = new long[](N+1);
    G = new long[](N+1);
    P2[0] = F[0] = G[0] = 1;

    foreach (i; 1..N+1) P2[i] = P2[i-1] * 2 % MOD;
    foreach (i; 1..N+1) F[i] = F[i-1] * i % MOD;
    foreach (i; 1..N+1) G[i] = powmod(F[i], MOD-2, MOD);

    long ans = F[N] * powmod(P2[N/2], MOD-2, MOD) % MOD * G[N/2] % MOD;

    for (int i = N-1, j = N-2, k = 0; i >= N / 2; --i, ++k) {
        j = min(j, i-1);
        while (j >= 0 && A[i] + A[j] > K) --j;
        if (j < k) {
            writeln(0);
            return;
        }
        long tmp = i - j - 1;
        long n = i - k - 1;
        tmp = tmp * F[n] % MOD * powmod(P2[n/2], MOD-2, MOD) % MOD * G[n/2] % MOD;
        ans -= tmp;
        ans %= MOD;
    }

    ans = (ans + MOD) % MOD;
    ans.writeln;
}

long powmod(long a, long x, long m) {
    long ret = 1;
    while (x) {
        if (x % 2) ret = ret * a % m;
        a = a * a % m;
        x /= 2;
    }
    return ret;
}